Conflict-driven answer set solving: From theory to practice

Authors:
Martin Gebser;Benjamin Kaufmann;Torsten Schaub
Affiliations:
Universität Potsdam, Institut für Informatik, August-Bebel-Str. 89, D-14482 Potsdam, Germany;Universität Potsdam, Institut für Informatik, August-Bebel-Str. 89, D-14482 Potsdam, Germany;Universität Potsdam, Institut für Informatik, August-Bebel-Str. 89, D-14482 Potsdam, Germany
Venue:
Artificial Intelligence
Year:
2012

Citing 80
Cited 5

Towards a theory of declarative knowledge

Foundations of deductive databases and logic programming
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
The relationship between stable, supported, default and autoepistemic semantics for general logic programs

Theoretical Computer Science
Optimal speedup of Las Vegas algorithms

Information Processing Letters
The expressive powers of the logic programming semantics

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Improvements to propositional satisfiability search algorithms

Improvements to propositional satisfiability search algorithms
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
Answer set programming and plan generation

Artificial Intelligence
Extending and implementing the stable model semantics

Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving

Knowledge Representation, Reasoning, and Declarative Problem Solving
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
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
A New Logical Characterisation of Stable Models and Answer Sets

NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Constraint Processing

Constraint Processing
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
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)
A backjumping technique for disjunctive logic programming

AI Communications
Answer Set Programming Based on Propositional Satisfiability

Journal of Automated Reasoning
Handbook of Constraint Programming (Foundations of Artificial Intelligence)

Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Solving SAT and SAT Modulo Theories: From an abstract Davis--Putnam--Logemann--Loveland procedure to DPLL(T)

Journal of the ACM (JACM)
Pruning Operators for Disjunctive Logic Programming Systems

Fundamenta Informaticae
Enhancing DLV instantiator by backjumping techniques

Annals of Mathematics and Artificial Intelligence
A Logic Programming Approach to Home Monitoring for Risk Prevention in Assisted Living

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automatic Composition of Melodic and Harmonic Music by Answer Set Programming

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
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
Stable models and difference logic

Annals of Mathematics and Artificial Intelligence
Solution Enumeration for Projected Boolean Search Problems

CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Advanced Preprocessing for Answer Set Solving

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
The Significance of Memory Costs in Answer Set Solver Implementation

Journal of Logic and Computation
Fast SAT-based answer set solver

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 for Single-Player Games in General Game Playing

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
Constraint Answer Set Solving

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 Simple Distributed Conflict-Driven Answer Set Solver

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Conflict-Driven Answer Set Solver clasp: Progress Report

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
The Second Answer Set Programming Competition

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Experiences Running a Parallel Answer Set Solver on Blue Gene

Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
A new clause learning scheme for efficient unsatisfiability proofs

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Towards understanding and harnessing the potential of clause learning

Journal of Artificial Intelligence Research
Conflict-driven answer set solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A model-theoretic counterpart of loop formulas

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Predicting learnt clauses quality in modern SAT solvers

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Circumscriptive event calculus as answer set programming

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Answer set versus integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs

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
Head-elementary-set-free logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Clasp: a conflict-driven answer set solver

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Towards a better understanding of the functionality of a conflict-driven SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A lightweight component caching scheme for satisfiability solvers

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
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
Local restarts

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Semantics and complexity of recursive aggregates in answer set programming

Artificial Intelligence
On the power of clause-learning SAT solvers as resolution engines

Artificial Intelligence
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
Compact translations of non-disjunctive answer set programs to propositional clauses

Logic programming, knowledge representation, and nonmonotonic reasoning
Advances in gringo series 3

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
A portfolio solver for answer set programming: preliminary report

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Cluster-based ASP solving with claspar

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Loops: relevant or redundant?

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for propositional theories

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The nomore++ approach to answer set solving

LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Tableau calculi for answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
Effective preprocessing in SAT through variable and clause elimination

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing

Exploiting unfounded sets for HEX-Program evaluation

JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
(Re)Configuration using web data: a case study on the reviewer assignment problem

RR'12 Proceedings of the 6th international conference on Web Reasoning and Rule Systems
Conflict-driven asp solving with external sources

Theory and Practice of Logic Programming
Inductive definitions in constraint programming

ACSC '13 Proceedings of the Thirty-Sixth Australasian Computer Science Conference - Volume 135
Advanced conflict-driven disjunctive answer set solving

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.