dc.contributor.author | Gebser, Martin | |
dc.contributor.author | Kaufmann, Benjamin | |
dc.contributor.author | Schaub, Torsten | |
dc.date.accessioned | 2017-05-03T14:22:45Z | |
dc.date.available | 2017-05-03T14:22:45Z | |
dc.date.issued | 2012 | |
dc.date.modified | 2013-08-20T00:04:02Z | |
dc.identifier.issn | 0004-3702 | |
dc.identifier.doi | 10.1016/j.artint.2012.04.001 | |
dc.identifier.uri | http://hdl.handle.net/10072/52653 | |
dc.description.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. | |
dc.description.peerreviewed | Yes | |
dc.description.publicationstatus | Yes | |
dc.format.extent | 568087 bytes | |
dc.format.mimetype | application/pdf | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Elsevier | |
dc.publisher.place | Netherlands | |
dc.relation.ispartofstudentpublication | N | |
dc.relation.ispartofpagefrom | 52 | |
dc.relation.ispartofpageto | 89 | |
dc.relation.ispartofjournal | Artificial Intelligence | |
dc.relation.ispartofvolume | 187-188 | |
dc.rights.retention | Y | |
dc.subject.fieldofresearch | Artificial intelligence not elsewhere classified | |
dc.subject.fieldofresearch | Theory of computation | |
dc.subject.fieldofresearch | Cognitive and computational psychology | |
dc.subject.fieldofresearchcode | 460299 | |
dc.subject.fieldofresearchcode | 4613 | |
dc.subject.fieldofresearchcode | 5204 | |
dc.title | Conflict-driven answer set solving: From theory to practice | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.rights.copyright | © 2012 Elsevier B.V. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version. | |
gro.date.issued | 2012 | |
gro.hasfulltext | Full Text | |
gro.griffith.author | Schaub, Torsten | |