On the declarative and procedual semantics of logic programs
Journal of Automated Reasoning
Proceedings of the eleventh international conference on Logic programming
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
ACM Transactions on Database Systems (TODS)
Declarative problem-solving in DLV
Logic-based artificial intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Answer set programming and plan generation
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
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
A Logic Programming Approach to the Integration, Repairing and Querying of Inconsistent Databases
Proceedings of the 17th International Conference on Logic Programming
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A logic programming approach to knowledge-state planning, II: the DLVk system
Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
A logic programming approach to knowledge-state planning: Semantics and complexity
ACM Transactions on Computational Logic (TOCL)
An abductive framework for computing knowledge base updates
Theory and Practice of Logic Programming
Diagnostic reasoning with A-Prolog
Theory and Practice of Logic Programming
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
On the expressibility of stable logic programming
Theory and Practice of Logic Programming
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Conformant planning via symbolic model checking
Journal of Artificial Intelligence Research
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Resource allocation with answer-set programming
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
A meta-programming technique for debugging answer-set programs
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Computing fuzzy answer sets using DLVHEX
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Argumentation and answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
Hi-index | 0.00 |
Answer set programming (ASP) with disjunction offers a powerful tool for declaratively representing and solving hard problems. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise and intuitive way, where the encoding reflects the typical “guess and check” nature of NP problems: The property is encoded in a way such that polynomial size certificates for it correspond to stable models of a program. However, the problem-solving capacity of full disjunctive logic programs (DLPs) is beyond NP, and captures a class of problems at the second level of the polynomial hierarchy. While these problems also have a clear “guess and check” structure, finding an encoding in a DLP reflecting this structure may sometimes be a non-obvious task, in particular if the “check” itself is a co-NP-complete problem; usually, such problems are solved by interleaving separate guess and check programs, where the check is expressed by inconsistency of the check program. In this paper, we present general transformations of head-cycle free (extended) disjunctive logic programs into stratified and positive (extended) disjunctive logic programs based on meta-interpretation techniques. The answer sets of the original and the transformed program are in simple correspondence, and, moreover, inconsistency of the original program is indicated by a designated answer set of the transformed program. Our transformations facilitate the integration of separate “guess” and “check” programs, which are often easy to obtain, automatically into a single disjunctive logic program. Our results complement recent results on meta-interpretation in ASP, and extend methods and techniques for a declarative “guess and check” problem solving paradigm through ASP.