Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated. In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence - a property that seems to best capture the essence of forgetting in the context of ASP - whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program. This paper is under consideration for acceptance in TPLP.

本文描述了在使用ASP进行遗忘操作中，提出了第一个具体满足强持久性的运算符，该运算符具有许多重要性质，是一种句法运算符，可将遗忘操作的计算限制在包含要忘记的原子的规则中，从而自然地产生与原始程序接近的遗忘结果。

满足强持久性的遗忘语法操作符