论文标题
逻辑程序的强大等效性与计数
Strong Equivalence of Logic Programs with Counting
论文作者
论文摘要
在答案集编程中，如果在任何情况下具有相同的含义，则两组规则被认为是非常等效的。在某些情况下，可以通过从彼此的规则中得出每个程序的规则来确定程序中计划的强大等效性。已经证明了此类证明的可能性，包括该语言的一部分，其中包括比较，算术操作和简单的选择规则，但没有汇总。此方法已扩展到一类程序，其中允许#Count聚合的某些用途。本文正在考虑在TPLP中接受。
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. In some cases, strong equivalence of programs in the input language of the grounder gringo can be established by deriving rules of each program from rules of the other. The possibility of such proofs has been demonstrated for a subset of that language that includes comparisons, arithmetic operations, and simple choice rules, but not aggregates. This method is extended here to a class of programs in which some uses of the #count aggregate are allowed. This paper is under consideration for acceptance in TPLP.
