Conflict-driven answer set solving: From theory to practice

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 capt...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Artificial intelligence Ročník 187-188; s. 52 - 89
Hlavní autori: Gebser, Martin, Kaufmann, Benjamin, Schaub, Torsten
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Elsevier B.V 01.08.2012
Elsevier
Predmet:
Algorithms
Answer set programming
Applied sciences
Artificial intelligence
Computation
Computer science; control theory; systems
Exact sciences and technology
Expert systems
Learning and adaptive systems
Logic programming
Logical, boolean and switching functions
Nonmonotonic reasoning
Programming
Solvers
Theoretical computing
Versatility
Answer set programming
Nonmonotonic reasoning
Logic programming
Conflict resolution
Competitiveness
Knowledge representation
Algorithmics
Constraint satisfaction
Inference
Logical programming
Circumscription
Set theory
Satisfiability
ISSN:0004-3702, 1872-7921
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2012.04.001