A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
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
Extending and implementing the stable model semantics
Artificial Intelligence
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
SAT-Based Decision Procedures for Classical Modal Logics
Journal of Automated Reasoning
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Fages' Theorem for Programs with Nested Expressions
Proceedings of the 17th International Conference on Logic Programming
Modeling and Verification of Out-of-Order Microprocessors in UCLID
FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Checking Satisfiability of First-Order Formulas by Incremental Translation to SAT
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
SAT-Based Procedures for Temporal Reasoning
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Theory and applications of answer set programming
Theory and applications of answer set programming
Bounded LTL model checking with stable models
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Weight constraints as nested expressions
Theory and Practice of Logic Programming
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
The SAT-based Approach to Separation Logic
Journal of Automated Reasoning
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Generalizing Boolean satisfiability II: theory
Journal of Artificial Intelligence Research
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Experimenting with heuristics for answer set programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
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
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
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Dynamic scheduling in parallel answer set programming solvers
SpringSim '07 Proceedings of the 2007 spring simulation multiconference - Volume 2
Probabilistic Planning in Hybrid Probabilistic Logic Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
Enhancing a DLP System for Advanced Database Applications
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Case Study in Engineering SQL Constraint Database Systems (Extended Abstract)
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automata and Answer Set Programming
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Extended asp tableaux and rule redundancy in normal logic programs1
Theory and Practice of Logic Programming
On the relation among answer set solvers
Annals of Mathematics and Artificial Intelligence
Integrating answer set programming and constraint logic programming
Annals of Mathematics and Artificial Intelligence
Journal of Experimental & Theoretical Artificial Intelligence
Probabilistic Reasoning by SAT Solvers
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Computing Stable Models via Reductions to Difference Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A First Order Forward Chaining Approach for Answer Set Computing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Weight Constraint Programs with Functions
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Probabilistic Planning with Imperfect Sensing Actions Using Hybrid Probabilistic Logic Programs
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
An experimental comparison of constraint logic programming and answer set programming
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Efficient haplotype inference with answer set programming
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
Computer Languages, Systems and Structures
International Journal of Reconfigurable Computing - Special issue on selected papers from ReConFig 2008
Conflict-driven answer set enumeration
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Constraint processing in relational database systems: from theory to implementation
Proceedings of the 2010 ACM Symposium on Applied Computing
Extended ASP tableaux and rule redundancy in normal logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
Testing and debugging techniques for answer set solver development
Theory and Practice of Logic Programming
A 25-year perspective on logic programming
Hybrid reasoning with non-monotonic rules
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Detecting inconsistencies in large biological networks with answer set programming
Theory and Practice of Logic Programming
Challenges in answer set solving
Logic programming, knowledge representation, and nonmonotonic reasoning
Compact translations of non-disjunctive answer set programs to propositional clauses
Logic programming, knowledge representation, and nonmonotonic reasoning
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Look-back Techniques for ASP Programs with Aggregates
Fundamenta Informaticae
A system for the use of answer set programming in reinforcement learning
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Conflict-driven asp solving with external sources
Theory and Practice of Logic Programming
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
Hi-index | 0.00 |
Answer set programming (ASP) emerged in the late 1990s as a new logic programming paradigm that has been successfully applied in various application domains. Also motivated by the availability of efficient solvers for propositional satisfiability (SAT), various reductions from logic programs to SAT were introduced. All these reductions, however, are limited to a subclass of logic programs or introduce new variables or may produce exponentially bigger propositional formulas. In this paper, we present a SAT-based procedure, called ASPSAT, that (1) deals with any (nondisjunctive) logic program, (2) works on a propositional formula without additional variables (except for those possibly introduced by the clause form transformation), and (3) is guaranteed to work in polynomial space. From a theoretical perspective, we prove soundness and completeness of ASPSAT. From a practical perspective, we have (1) implemented ASPSAT in Cmodels, (2) extended the basic procedures in order to incorporate the most popular SAT reasoning strategies, and (3) conducted an extensive comparative analysis involving other state-of-the-art answer set solvers. The experimental analysis shows that our solver is competitive with the other solvers we considered and that the reasoning strategies that work best on `small but hard' problems are ineffective on `big but easy' problems and vice versa.