Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Theoretical Computer Science
Proceedings of the 1999 international conference on Logic programming
Extending and implementing the stable model semantics
Artificial Intelligence
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
MathSAT: Tight Integration of SAT and Mathematical Decision Procedures
Journal of Automated Reasoning
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Stable models and difference logic
Annals of Mathematics and Artificial Intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Clasp: a conflict-driven answer set solver
LPNMR'07 Proceedings of the 9th 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
DPLL(T) with exhaustive theory propagation and its application to difference logic
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Fast and flexible difference constraint propagation for DPLL(T)
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Fo(fd): Extending classical logic with rule-based fixpoint definitions
Theory and Practice of Logic Programming
Testing and debugging techniques for answer set solver development
Theory and Practice of Logic Programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Compact translations of non-disjunctive answer set programs to propositional clauses
Logic programming, knowledge representation, and nonmonotonic reasoning
The third answer set programming competition: preliminary report of the system competition track
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
The multi-engine ASP solver ME-ASP
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Tableau Calculi for Logic Programs under Answer Set Semantics
ACM Transactions on Computational Logic (TOCL)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
Propositional satisfiability (SAT) solvers provide a promising computational platform for logic programs under the stable model semantics. However, computing stable models of a logic program using a SAT solver presumes translating the program into a set of clauses which is the input form accepted by most SAT solvers. This leads to fairly complex super-linear translations. There are, however, interesting extensions to plain clausal propositional representations such as difference logic. A number of solvers have been developed for difference logic, in particular in the context of the satisfiability modulo theories (SMT) framework, and the goal of the paper is to study whether such engines could be harnessed to the computation of stable models for logic programs in an effective way. To this end, we provide succinct translations from logic programs to theories of difference logic and evaluate the potential of SMT solvers in the computation of stable models using these translations and a selection of benchmarks.