The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Theory and Practice of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A generalization of the Lin-Zhao theorem
Annals of Mathematics and Artificial Intelligence
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
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
On elementary loops of logic programs
Theory and Practice of Logic Programming
Hi-index | 0.00 |
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one hand, concepts like loops and elementary sets have been proposed in order to extend Clark's completion for computing answer sets of logic programs by means of propositional logic. On the other hand, different concepts of program equivalence, like strong and uniform equivalence, have been studied in the context of program optimization and modular programming. In this paper, we bring these two lines of research together and provide alternative characterizations for different conceptions of equivalence in terms of unfounded sets, along with the related concepts of loops and elementary sets. Our results yield new insights into the model theory of equivalence checking. We further exploit these characterizations to develop novel encodings of program equivalence in terms of standard and quantified propositional logic, respectively.