License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICLP.2018.20
URN: urn:nbn:de:0030-drops-98861
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9886/
Taupe, Richard
Speeding up Lazy-Grounding Answer Set Solving
Abstract
The grounding bottleneck is an important open issue in Answer Set Programming. Lazy grounding addresses it by interleaving grounding and search. The performance of current lazy-grounding solvers is not yet comparable to that of ground-and-solve systems, however. The aim of this thesis is to extend prior work on lazy grounding by novel heuristics and other techniques like non-ground conflict learning in order to speed up solving. Parts of expected results will be beneficial for ground-and-solve systems as well.
BibTeX - Entry
@InProceedings{taupe:OASIcs:2018:9886,
author = {Richard Taupe},
title = {{Speeding up Lazy-Grounding Answer Set Solving}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {20:1--20:9},
series = {OpenAccess Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Alessandro Dal Palu' and Paul Tarau and Neda Saeedloei and Paul Fodor},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9886},
URN = {urn:nbn:de:0030-drops-98861},
doi = {10.4230/OASIcs.ICLP.2018.20},
annote = {Keywords: answer set programming, lazy grounding, heuristics}
}
|
Keywords: |
|
answer set programming, lazy grounding, heuristics |
|
Collection: |
|
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
19.11.2018 |
