Foundations of logic programming
Principles of knowledge representation
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Theory and applications of answer set programming
Theory and applications of answer set programming
Theory and Practice of Logic Programming
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Loop formulas for circumscription
Artificial Intelligence
Temporal phylogenetic networks and logic programming
Theory and Practice of Logic Programming
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Justifications for logic programs under answer set semantics
Theory and Practice of Logic Programming
Journal of Experimental & Theoretical Artificial Intelligence
Removed Sets Fusion: Performing Off The Shelf
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Loop formulas for circumscription
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Loop formulas for circumscription
Artificial Intelligence
Answer set programming for representing and reasoning about virtual institutions
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Multivalued action languages with constraints in CLP(FD)
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Using ASP to improve the information reuse in mechanical assembly sequence planning
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Automatic music composition using answer set programming
Theory and Practice of Logic Programming
Finding reductions automatically
Fields of logic and computation
On the relation between answer set and sat procedures (or, between cmodels and smodels)
ICLP'05 Proceedings of the 21st international conference on Logic Programming
A comparison of CLP(FD) and ASP solutions to NP-Complete problems
ICLP'05 Proceedings of the 21st international conference on Logic Programming
CMODELS: SAT-based disjunctive answer set solver
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Evaluating search strategies and heuristics for efficient answer set programming
AI*IA'05 Proceedings of the 9th conference on Advances in Artificial Intelligence
TOAST: applying answer set programming to superoptimisation
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
On elementary loops of logic programs
Theory and Practice of Logic Programming
Goal-directed execution of answer set programs
Proceedings of the 14th symposium on Principles and practice of declarative programming
Annotating answer-set programs in lana*
Theory and Practice of Logic Programming
Reasoning about conditional constraint specification problems and feature models
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
| Hi-index | 0.00 |
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boost of SAT solvers during last years. Various translations from ASP to SAT are known but the resulting SAT formula either includes many new variables or may have an unpractical size. There are also well known results showing a one-to-one correspondence between the answer sets of a logic program and the model of its completion. Unfortunately, these results only work for specific classes of problems. In this paper we present a SAT-based decision procedure for answer set programming that (i) deals with any (non disjunctive) logic program, (ii) works on a SAT formula without additional variables, and (iii) is guaranteed to work in polynomial space. Further, our procedure can be extended to compute all the answer sets still working in polynomial space. The experimental results of a prototypical implementation show that the approach can pay off sometimes by orders of magnitude.