Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
Stationary semantics for disjunctive logic programs and deductive databases
Proceedings of the 1990 North American conference on Logic programming
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Implementing semantics of disjunctive logic programs using fringes and abstract properties
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
Proceedings of the eleventh international conference on Logic programming
Computing stable models by program transformation
Proceedings of the eleventh international conference on Logic programming
The complexity of logic-based abduction
Journal of the ACM (JACM)
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
Efficient evaluation of a class of ordered logic programs
Data & Knowledge Engineering
ACM Transactions on Database Systems (TODS)
Reasoning with minimal models: efficient algorithms and applications
Artificial Intelligence
Beyond NP: the QSAT phase transition
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Proceedings of the 1999 international conference on Logic programming
Computational complexity of planning and approximate planning in the presence of incompleteness
Artificial Intelligence
Declarative problem-solving in DLV
Logic-based artificial intelligence
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Default Logic as a Query Language
IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints
IEEE Transactions on Knowledge and Data Engineering
Stable Model Checking Made Easy
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Polynomial-Length Planning Spans the Polynomial Hierarchy
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
An incremental algorithm for generating all minimal models
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
A backjumping technique for disjunctive logic programming
AI Communications
The DLV Project: A Tour from Theory and Research to Applications and Market
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
The Logical Consequence Role in LPNMR: A Parameterized Computation Approach
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
Declarative and computational properties of logic programs with aggregates
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Heuristics for hard ASP programs
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An incremental algorithm for generating all minimal models
Artificial Intelligence
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
A 25-year perspective on logic programming
DLVMC: enhanced model checking in DLV
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Unfounded sets for disjunctive logic programs with arbitrary aggregates
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Solving hard ASP programs efficiently
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
On elementary loops of logic programs
Theory and Practice of Logic Programming
Exploiting unfounded sets for HEX-Program evaluation
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Advanced conflict-driven disjunctive answer set solving
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Disjunctive logic programming (DLP) with stable model semantics is a powerful nonmonotonic formalism for knowledge representation and reasoning. Reasoning with DLP is harder than with normal (v-free) logic programs, because stable model checking--deciding whether a given model is a stable model of a propositional DLP program--is co-NP-complete, while it is polynomial for normal logic programs.This paper proposes a new transformation ΓM(P), which reduces stable model checking to UNSAT--i.e., to deciding whether a given CNF formula is unsatisfiable. The stability of a model M of a program P thus can be verified by calling a Satisfiability Checker on the CNF formula ΓM(P). The transformation is parsimonious (i.e., no new symbol is added), and efficiently computable, as it runs in logarithmic space (and therefore in polynomial time). Moreover, the size of the generated CNF formula never exceeds the size of the input (and is usually much smaller). We complement this transformation with modular evaluation results, which allow for efficient handling of large real-world reasoning problems.The proposed approach to stable model checking has been implemented in DLV--a state-of-the-art implementation of DLP. A number of experiments and benchmarks have been run using SATZ as Satisfiability checker. The results of the experiments are very positive and confirm the usefulness of our techniques.