10.4230/LIPICS.ICLP.2012.201
De Cat, Broes
Broes
De Cat
Denecker, Marc
Marc
Denecker
Stuckey, Peter
Peter
Stuckey
Lazy Model Expansion by Incremental Grounding
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
Knowledge representation and reasoning
model generation
grounding
IDP framework
first-order logic
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
2012
2012-09-05
2012-09-05
2012-09-05
en
urn:nbn:de:0030-drops-36222
10.4230/LIPIcs.ICLP.2012
978-3-939897-43-9
1868-8969
10.4230/LIPIcs.ICLP.2012
LIPIcs, Volume 17, ICLP 2012
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
2013
17
19
201
211
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2012
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
11 pages
529495 bytes
application/pdf
Creative Commons Attribution-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
Ground-and-solve methods used in state-of-the-art Answer Set Programming and model expansion systems proceed by rewriting the problem specification into a ground format and afterwards
applying search. A disadvantage of such approaches is that the rewriting step blows up the original specification for large input domains and is unfeasible in case of infinite domains. In this
paper we describe a lazy approach to model expansion in the context of first-order logic that can cope with large and infinite problem domains. The method interleaves grounding and search, incrementally extending the current partial grounding only when necessary. It often allows to solve the original problem without creating the full grounding and is hence more widely applicable than ground-and-solve. We report on an existing implementation within the IDP system
and on experiments that show the promise of the method.
LIPIcs, Vol. 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), pages 201-211