The search result changed since you submitted your search request. Documents might be displayed in a different sort order.
  • search hit 92 of 960
Back to Result List

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

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics
Metadaten
Author:Martin GebserORCiD, Benjamin Kaufmann, Torsten SchaubORCiDGND
DOI:https://doi.org/10.1016/j.artint.2012.04.001
ISSN:0004-3702 (print)
Parent Title (English):Artificial intelligence
Publisher:Elsevier
Place of publication:Amsterdam
Document Type:Article
Language:English
Year of first Publication:2012
Year of Completion:2012
Release Date:2017/03/26
Tag:Answer set programming; Logic programming; Nonmonotonic reasoning
Volume:187
Issue:8
Pagenumber:38
First Page:52
Last Page:89
Funder:German Science Foundation (DFG) [SCHA 550/8-1, SCHA 550/8-2]
Organizational units:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik und Computational Science
Peer Review:Referiert
Institution name at the time of publication:Mathematisch-Naturwissenschaftliche Fakultät / Institut für Informatik