arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.7541cs.AIcs.LO
收藏

保持强等价的选言逻辑程序的遗忘处理

An Approach to Forgetting in Disjunctive Logic Programs that Preserves Strong Equivalence

Simon Fraser University(西蒙弗雷泽大学);Griffith University(格里菲斯大学)

James P. Delgrande, Kewen Wang

摘要:

在本文中,我们研究了遗忘的析取逻辑程序,其中忘记一个原子从一个程序相当于减少该程序的签名。我们的目标是提供一种语法独立的方法,如果两个程序是强等价的,那么每个程序中忘记一个原子的结果也应该是强等价的。我们对遗忘的中心定义是不切实际的,但满足了这个目标:遗忘一个原子的特征是程序的SE结果集,这些SE结果没有提到要被遗忘的原子。然后,我们提供了一个等效的、实用的定义,其中,遗忘原子$p$是由程序中不提及$p$的那些规则以及通过从提及$p$的规则中的单个推理步骤获得的规则给出的。遗忘被证明有适当的属性,以及,有限的表征结果在一个温和的(在最坏的二次)爆破。最后,我们也得到了一个原型实现这种方法的遗忘。

英文摘要:

In this paper we investigate forgetting in disjunctive logic programs, where forgetting an atom from a program amounts to a reduction in the signature of that program. The goal is to provide an approach that is syntax-independent, in that if two programs are strongly equivalent, then the results of forgetting an atom in each program should also be strongly equivalent. Our central definition of forgetting is impractical but satisfies this goal: Forgetting an atom is characterised by the set of SE consequences of the program that do not mention the atom to be forgotten. We then provide an equivalent, practical definition, wherein forgetting an atom $p$ is given by those rules in the program that don't mention $p$, together with rules obtained by a single inference step from rules that do mention $p$. Forgetting is shown to have appropriate properties; as well, the finite characterisation results in a modest (at worst quadratic) blowup. Finally we have also obtained a prototype implementation of this approach to forgetting.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑