Foundations of deductive databases and 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
cc{\rm T}: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming
CIC '06 Proceedings of the 15th International Conference on Computing
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Automated Verification of Weak Equivalence within the smodels System*
Theory and Practice of Logic Programming
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'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
On solution correspondences in answer-set programming
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Discovering classes of strongly equivalent logic programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
SELP – a system for studying strong equivalence between logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
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
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc T
Applications of Declarative Programming and Knowledge Management
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions
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
| Hi-index | 0.00 |
Recent research in answer-set programming (ASP) focuses on different notions of equivalence between programs which are relevant for program optimisation and modular programming. Prominent among these notions is uniform equivalence, which checks whether two programs have the same semantics when joined with an arbitrary set of facts. In this paper, we study a family of more fine-grained versions of uniform equivalence, where the alphabet of the added facts as well as the projection of answer sets is taken into account. The latter feature, in particular, allows the removal of auxiliary atoms in computation, which is important for practical programming aspects. We introduce novel semantic characterisations for the equivalence problems under consideration and analyse the computational complexity for checking these problems. We furthermore provide efficient reductions to quantified propositional logic, yielding a rapid-prototyping system for equivalence checking.