Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Iterative belief revision in extended logic programming
Theoretical Computer Science
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
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
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
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
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Loop formulas for circumscription
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Causal theories of action and change
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Graphs and colorings for answer set programming
Theory and Practice of Logic Programming
Answer Set Programming Based on Propositional Satisfiability
Journal of Automated Reasoning
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
Recycling computed answers in rewrite systems for abduction
ACM Transactions on Computational Logic (TOCL)
Quartet-Based Phylogeny Reconstruction with Answer Set Programming
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Normalize, transpose, and distribute: An automatic approach for handling nonscalars
ACM Transactions on Programming Languages and Systems (TOPLAS)
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Enhancing DLV instantiator by backjumping techniques
Annals of Mathematics and Artificial Intelligence
Semantic forgetting in answer set programming
Artificial Intelligence
Experimenting with parallelism for the instantiation of ASP programs
Journal of Algorithms
Probabilistic Planning in Hybrid Probabilistic Logic Programs
SUM '07 Proceedings of the 1st international conference on Scalable Uncertainty Management
A Logical Framework to Reinforcement Learning Using Hybrid Probabilistic Logic Programs
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
On the Relationship between Hybrid Probabilistic Logic Programs and Stochastic Satisfiability
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
Twelve Definitions of a Stable Model
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Quo Vadis Answer Set Programming?
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Here's the Beef: Answer Set Programming !
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Engineering an Incremental ASP Solver
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Compiling Fuzzy Answer Set Programs to Fuzzy Propositional Theories
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Probabilistic reasoning with answer sets
Theory and Practice of Logic Programming
Extended asp tableaux and rule redundancy in normal logic programs1
Theory and Practice of Logic Programming
Achieving compositionality of the stable model semantics for smodels programs1
Theory and Practice of Logic Programming
spock: A Debugging Support Tool for Logic Programs under the Answer-Set Semantics
Applications of Declarative Programming and Knowledge Management
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
Comparison of semantics of disjunctive logic programs based on model-equivalent reduction
Journal of Computer Science and Technology
Evaluating ASP and commercial solvers on the CSPLib
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Advanced Preprocessing for Answer Set Solving
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Removed Sets Fusion: Performing Off The Shelf
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Merging Belief Bases Represented by Logic Programs
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Probabilistic Reasoning by SAT Solvers
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Forgetting and conflict resolving in disjunctive logic programming
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Elementary sets for logic programs
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Answer Set Programming with Constraints Using Lazy Grounding
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
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
Max-ASP: Maximum Satisfiability of Answer Set Programs
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
Translating Preferred Answer Set Programs to Propositional Logic
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Towards an Embedded Approach to Declarative Problem Solving in ASP
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
Finite Satisfiability in Infinite-Valued Łukasiewicz Logic
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
A theory of forgetting in logic programming
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Loop formulas for logic programs with arbitrary constraint atoms
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
What is answer set programming?
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Conflict-driven answer set solving
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Epistemic reasoning in logic programs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
A model-theoretic counterpart of loop formulas
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Symmetric splitting in the general theory of stable models
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Computer Languages, Systems and Structures
Verifying Software Requirements Based on Answer Set Programming
KSEM '09 Proceedings of the 3rd International Conference on Knowledge Science, Engineering and Management
A parallel ASP instantiator based on DLV
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
Actions Over a Constructive Semantics for Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
GASP: Answer Set Programming with Lazy Grounding
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Debugging ASP programs by means of ASP
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Conflict-driven answer set enumeration
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Head-elementary-set-free logic programs
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Extended ASP tableaux and rule redundancy in normal logic programs
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Integrating inductive definitions in SAT
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
SAT(ID): satisfiability of propositional logic extended with inductive definitions
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Catching the ouroboros: On debugging non-ground answer-set programs
Theory and Practice of Logic Programming
Loop formulas for description logic programs
Theory and Practice of Logic Programming
Testing and debugging techniques for answer set solver development
Theory and Practice of Logic Programming
On Testing Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Loop-separable programs and their first-order definability
Artificial Intelligence
Potassco: The Potsdam Answer Set Solving Collection
AI Communications - Answer Set Programming
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Guarded resolution for answer set programming
Theory and Practice of Logic Programming
Abstract answer set solvers with backjumping and learning
Theory and Practice of Logic Programming
Theory and Practice of Logic Programming
Thirteen definitions of a stable model
Fields of logic and computation
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
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
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Application of answer set programming for public health data integration and analysis
ARES'11 Proceedings of the IFIP WG 8.4/8.9 international cross domain conference on Availability, reliability and security for business, enterprise and health information systems
Weight constraint programs with evaluable functions
Annals of Mathematics and Artificial Intelligence
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Reducing inductive definitions to propositional satisfiability
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
The loop formula based semantics of description logic programs
Theoretical Computer Science
The nomore++ approach to answer set solving
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Satisfiability checking for PC(ID)
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Ordered completion for first-order logic programs on finite structures
Artificial Intelligence
Tableau calculi for answer set programming
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
TOAST: applying answer set programming to superoptimisation
ICLP'06 Proceedings of the 22nd international conference on Logic Programming
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On elementary loops of logic programs
Theory and Practice of Logic Programming
Implementation and experimentation of the logic language NP Datalog
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
First-Order encodings for modular nonmonotonic datalog programs
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
First-order stable model semantics and first-order loop formulas
Journal of Artificial Intelligence Research
Conflict-driven answer set solving: From theory to practice
Artificial Intelligence
Relating the semantics of abstract dialectical frameworks and standard AFs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Logic programming for Boolean networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Well-supported semantics for description logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains
ACM Transactions on Computational Logic (TOCL)
The intelligent grounder of DLV
Correct Reasoning
Actions Over a Constructive Semantics for Description Logics
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
GASP: Answer Set Programming with Lazy Grounding
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Pruning Operators for Disjunctive Logic Programming Systems
Fundamenta Informaticae
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)
Inductive definitions in constraint programming
ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Forgetting for answer set programs revisited
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
A Tabled Prolog Program for Solving Sokoban
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
Hi-index | 0.00 |
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal 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. In the worst case, there may be an exponential number of loops in a logic program. To address this problem, we propose an approach that adds loop formulas a few at a time, selectively. Based on these results, we implement a system called ASSAT(X), depending on the SAT solver X used, for computing one answer set of a normal logic program with constraints. We test the system on a variety of benchmarks including the graph coloring, the blocks world planning, and Hamiltonian Circuit domains. Our experimental results show that in these domains, for the task of generating one answer set of a normal logic program, our system has a clear edge over the state-of-art answer set programming systems Smodels and DLV.