Foundations of deductive databases and logic programming
Fully abstract compositional semantics for logic programs
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Handbook of theoretical computer science (vol. B)
Proceedings of the eleventh international conference on Logic programming
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
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
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)
A common view on strong, uniform, and other notions of equivalence in answer-set programming*
Theory and Practice of Logic Programming
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
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
The first answer set programming system competition
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Modularity aspects of disjunctive stable models
LPNMR'07 Proceedings of the 9th 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
Equivalence between extended datalog programs -- a brief survey
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applications in program optimization and modular programming due to its flexibility that allows us to restrict, independently of each other, the head and body alphabets in context programs. We study relativized hyperequivalence for the three semantics of logic programs given by stable, supported, and supported minimal models. For each semantics, we identify four types of contexts, depending on whether the head and body alphabets are given directly or as the complement of a given set. Hyperequivalence relative to contexts where the head and body alphabets are specified directly has been studied before. In this paper, we establish the complexity of deciding relativized hyperequivalence with respect to the three other types of context programs.