Institut für Informatik und Computational Science
Refine
Has Fulltext
- no (1)
Year of publication
- 2012 (1)
Document Type
- Article (1) (remove)
Language
- English (1)
Is part of the Bibliography
- yes (1)
Keywords
- Nonmonotonic reasoning (1) (remove)
Institute
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.