Semantical considerations on nonmonotonic logic
Artificial Intelligence
On the relation between default and autoepistemic logic
Artificial Intelligence
Equivalences of logic programs
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
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
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Characterization of strongly equivalent logic programs in intermediate logics
Theory and Practice of Logic Programming
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Strong and uniform equivalence of nonmonotonic theories: an algebraic approach
Annals of Mathematics and Artificial Intelligence
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
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Sound and complete inference rules for SE-consequence
Journal of Artificial Intelligence Research
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
On modular translations and strong equivalence
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
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
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Logic programming for Boolean networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
| Hi-index | 0.00 |
Recent research in nonmonotonic logic programming has focused on certain types of program equivalence, which we refer to here as hyperequivalence, that are relevant for program optimization and modular programming. So far, most results concern hyperequivalence relative to 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 family of hyperequivalence relations for programs based on the semantics of supported and supported minimal models. We characterize these relations in model-theoretic terms. We use the characterizations to derive complexity results concerning testing whether two programs are hyperequivalent relative to supported and supported minimal models.