LIPIcs.ICLP.2012.188.pdf
- Filesize: 414 kB
- 13 pages
Document
Answer Set Solving with Lazy Nogood Generation
Authors
-
Part of:
Volume:
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12) (ICLP 2012)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NoDerivs 3.0 Unported license
- Publication Date: 2012-09-05
Cite AsGet BibTex
Christian Drescher and Toby Walsh. Answer Set Solving with Lazy Nogood Generation. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 188-200, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
https://doi.org/10.4230/LIPIcs.ICLP.2012.188
https://doi.org/10.4230/LIPIcs.ICLP.2012.188
Abstract
Although Answer Set Programming (ASP) systems are highly optimised, their performance is sensitive to the size of the input and the inference it encodes. We address this deficiency by introducing a new extension to ASP solving. The idea is to integrate external propagators to represent parts of the encoding implicitly, rather than generating it a-priori. To match the state-of-the-art in conflict-driven solving, however, external propagators can make their inference explicit on demand. We demonstrate applicability in a novel Constraint Answer Set Programming system that can seamlessly integrate constraint propagation without sacrifficing the advantages
of conflict-driven techniques. Experiments provide evidence for computational impact.
Keywords
- Conflict-Driven Nogood Learning
- Constraint Answer Set Programming
- Constraint Propagation
- Lazy Nogood Generation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads