Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Strong equivalence made easy: nested expressions and weight constraints
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
A solver for QBFs in negation normal form
Constraints
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
Program Correspondence under the Answer-Set Semantics: The Non-ground Case
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of 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
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
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
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
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
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
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Theory and Practice of Logic Programming
On the minimality of stable models
Logic programming, knowledge representation, and nonmonotonic reasoning
Exploring relations between answer set programs
Logic programming, knowledge representation, and nonmonotonic reasoning
Synonymous theories and knowledge representations in answer set programming
Journal of Computer and System Sciences
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
cc⊤: a correspondence-checking tool for logic programs under the answer-set semantics
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Generality relations in answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Interpolable formulas in equilibrium logic and answer set programming
Journal of Artificial Intelligence Research
A Model-Theoretic Approach to Belief Change in Answer Set Programming
ACM Transactions on Computational Logic (TOCL)
Forgetting for answer set programs revisited
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We introduce a general framework for specifying program correspondence under the answer-set semantics. The framework allows to define different kinds of equivalence notions, including previously defined notions like strong and uniform equivalence, in which programs are extended with rules from a given context, and correspondence is determined by means of a binary relation. In particular, refined equivalence notions based on projected answer sets can be defined within this framework, where not all parts of an answer set are of relevance. We study general characterizations of inclusion and equivalence problems, introducing novel semantical structures. Furthermore, we deal with the issue of determining counterexamples for a given correspondence problem, and we analyze the computational complexity of correspondence checking.