Equivalences of logic programs
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Handbook of theoretical computer science (vol. B)
Prioritized logic programming and its application to commonsense reasoning
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Extending and implementing the stable model semantics
Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Induction from answer sets in nonmonotonic logic programs
ACM Transactions on Computational Logic (TOCL)
Ordering default theories and nonmonotonic logic programs
Theoretical Computer Science
Coordination in answer set programming
ACM Transactions on Computational Logic (TOCL)
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
Rule Calculus: Semantics, Axioms and Applications
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Merging Logic Programs under Answer Set Semantics
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
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
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Generality and equivalence relations in default logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Hyperequivalence of logic programs with respect to supported models
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
Learning extended logic programs
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Equivalence in abductive logic
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A characterization of strong equivalence for logic programs with variables
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Constructing consensus logic programs
LOPSTR'06 Proceedings of the 16th international conference on Logic-based program synthesis and transformation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Combining answer sets of nonmonotonic logic programs
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Hi-index | 0.00 |
Equivalence and generality relations over logic programs have been proposed in answer set programming to semantically compare information contents of logic programs. In this paper, we overview previous relations of answer set programs, and propose a general framework that subsumes previous relations. The proposed framework allows us to compare programs possibly having non-minimal answer sets as well as to explore new relations between programs. Such new relations include relativized variants of generality relations over logic programs. By selecting contexts for comparison, the proposed framework can represent weak, strong and uniform variants of generality, inclusion and equivalence relations. These new relations can be applied to comparison of abductive logic programs and coordination of multiple answer set programs.