Iterative belief revision in extended logic programming
Theoretical Computer Science
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison
AI '02 Proceedings of the 15th Conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
Enhancing disjunctive logic programming systems by SAT checkers
Artificial Intelligence
Event choice datalog: a logic programming language for reasoning in multiple dimensions
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
ASSAT: computing answer sets of a logic program by SAT solvers
Artificial Intelligence - Special issue on nonmonotonic reasoning
Logic programming with infinite sets
Annals of Mathematics and Artificial Intelligence
Optimization of bound disjunctive queries with constraints
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Unfolding partiality and disjunctions in stable model semantics
ACM Transactions on Computational Logic (TOCL)
Predicate-calculus-based logics for modeling and solving search problems
ACM Transactions on Computational Logic (TOCL)
Why are there so many loop formulas?
ACM Transactions on Computational Logic (TOCL)
Loop formulas for circumscription
Artificial Intelligence
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Issues in parallel execution of non-monotonic reasoning systems
Parallel Computing
Temporal phylogenetic networks and logic programming
Theory and Practice of Logic Programming
Domain-dependent knowledge in answer set planning
ACM Transactions on Computational Logic (TOCL)
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Semantical characterizations and complexity of equivalences in answer set programming
ACM Transactions on Computational Logic (TOCL)
Computer-aided Support for Secure Tropos
Automated Software Engineering
Theory and Practice of Logic Programming
Outlier detection by logic programming
ACM Transactions on Computational Logic (TOCL)
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
On look-ahead heuristics in disjunctive logic programming
Annals of Mathematics and Artificial Intelligence
Enhancing DLV instantiator by backjumping techniques
Annals of Mathematics and Artificial Intelligence
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
Semantic forgetting in answer set programming
Artificial Intelligence
Outlier detection using default reasoning
Artificial Intelligence
Twelve Definitions of a Stable Model
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
Automata and Answer Set Programming
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Justifications for logic programs under answer set semantics
Theory and Practice of Logic Programming
My work with Victor Marek: a mathematician looks at answer set programming
Annals of Mathematics and Artificial Intelligence
Hyperequivalence of logic programs with respect to supported models
Annals of Mathematics and Artificial Intelligence
Stable models and difference logic
Annals of Mathematics and Artificial Intelligence
Journal of Experimental & Theoretical Artificial Intelligence
SAT-based answer set programming
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
On odd and even cycles in normal logic programs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Adding time and intervals to procedural and hierarchical control specifications
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Loop formulas for circumscription
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Fast SAT-based answer set solver
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Properties of programs with monotone and convex constraints
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the equivalence between answer sets and models of completion for nested logic programs
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Loop formulas for circumscription
Artificial Intelligence
On the complexity of answer set programming with aggregates
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A 25-year perspective on logic programming
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Stable models and circumscription
Artificial Intelligence
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Thirteen definitions of a stable model
Fields of logic and computation
Effectively reasoning about infinite sets in answer set programming
Logic programming, knowledge representation, and nonmonotonic reasoning
ASP at work: spin-off and applications of the DLV system
Logic programming, knowledge representation, and nonmonotonic reasoning
Loop formulas for splitable temporal logic programs
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
ASPIDE: integrated development environment for answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer set programming at a glance
Communications of the ACM
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
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Guarded open answer set programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
External sources of computation for answer set solvers
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
Pbmodels: software to compute stable models by pseudoboolean solvers
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
Answer set programming: a declarative approach to solving search problems
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
The relationship between reasoning about privacy and default logics
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Magic Sets for disjunctive Datalog programs
Artificial Intelligence
RW'13 Proceedings of the 9th international conference on Reasoning Web: semantic technologies for intelligent data access
Hi-index | 0.02 |
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a logic program, we show that by adding, for each loop in the program, a corresponding loop formula to the program's completion, we obtain a one-to-one correspondence between the answer sets of the program and the models of the resulting propositional theory. Compared with the translation by Ben-Eliyahu and Dechter, ours has the advantage that it does not use any extra variables, and is considerably simpler, thus easier to understand. However, in the worst case, it requires computing exponential number of loop formulas. To address this problem, we propose an approach that adds loop formulas a few at a time, selectively. Based on these results, we implemented a system called ASSAT(X), depending on the SAT solver X used, and tested it on a variety of benchmarks including the graph coloring, the blocks world planning, and Hamiltonian Circuit domains. The results are compared with those by smodels and dlv, and it shows a clear edge of ASSAT(X) over them in these domains.