On the relation between default and autoepistemic logic
Artificial Intelligence
Embedding a default system into nonmonotonic logics
Fundamenta Informaticae
Modal nonmonotonic logic with restricted application of the negation as failure to prove rule
Fundamenta Informaticae
Handbook of theoretical computer science (vol. B)
Reasoning with parsimonious and moderately grounded expansions
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
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)
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
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'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
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Analysing and extending well-founded and partial stable semantics using partial equilibrium logic
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Relativized Hyperequivalence of Logic Programs for Modular Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
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 nonmonotonic logic programming has focused on program equivalence relevant for program optimization and modular programming. So far, most results concern the stable-model semantics. However, other semantics for logic programs are also of interest, especially the semantics of supported models which, when properly generalized, is closely related to the autoepistemic logic of Moore. In this paper, we consider a framework of equivalence notions for logic programs under the supported (minimal) model-semantics and provide characterizations for this framework in model-theoretic terms. We use these characterizations to derive complexity results concerning testing hyperequivalence of logic programs wrt supported (minimal) models.