Download PDFOpen PDF in browser

Speeding Up Lazy-Grounding Answer Set Solving

EasyChair Preprint 383

9 pagesDate: July 30, 2018

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.

Keyphrases: Answer Set Programming, Heuristics, lazy grounding

BibTeX entry
BibTeX does not have the right entry for preprints. This is a hack for producing the correct reference:
@booklet{EasyChair:383,
  author    = {Richard Taupe},
  title     = {Speeding Up Lazy-Grounding Answer Set Solving},
  doi       = {10.29007/dt1r},
  howpublished = {EasyChair Preprint 383},
  year      = {EasyChair, 2018}}
Download PDFOpen PDF in browser