Foundations of deductive databases and logic programming
Proceedings of the eleventh international conference on Logic programming
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Modular Equivalence for Normal Logic Programs
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Relativized hyperequivalence of logic programs for modular programming
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Characterizing strong equivalence for argumentation frameworks
Artificial Intelligence
Answer set programming at a glance
Communications of the ACM
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Belief base change operations for answer set programming
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Hi-index | 0.02 |
Logic programming under the answer-set semantics nowadays deals with numerous different notions of program equivalence. This is due to the fact that equivalence for substitution (known as strong equivalence) and ordinary equivalence are different concepts. The former holds, given programs P and Q, iff P can be faithfully replaced by Q within any context R, while the latter holds iff P and Q provide the same output, that is, they have the same answer sets. Notions in between strong and ordinary equivalence have been introduced as theoretical tools to compare incomplete programs and are defined by either restricting the syntactic structure of the considered context programs R or by bounding the set $\A$ of atoms allowed to occur in R (relativized equivalence). For the latter approach, different $\A$ yield properly different equivalence notions, in general. For the former approach, however, it turned out that any “reasonable” syntactic restriction to R coincides with either ordinary, strong, or uniform equivalence (for uniform equivalence, the context ranges over arbitrary sets of facts, rather than program rules). In this paper, we propose a parameterization for equivalence notions which takes care of both such kinds of restrictions simultaneously by bounding, on the one hand, the atoms which are allowed to occur in the rule heads of the context and, on the other hand, the atoms which are allowed to occur in the rule bodies of the context. We introduce a general semantical characterization which includes known ones as SE-models (for strong equivalence) or UE-models (for uniform equivalence) as special cases. Moreover, we provide complexity bounds for the problem in question and sketch a possible implementation method making use of dedicated systems for checking ordinary equivalence.