Lazy model expansion by incremental grounding

Broes De Cat, Marc Denecker, Peter Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

9 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationTechnical Communications of the 28th International Conference on Logic Programming, ICLP 2012
Pages201-211
Number of pages11
DOIs
Publication statusPublished - 1 Dec 2012
Externally publishedYes
EventInternational Conference on Logic Programming 2012 - Budapest, Hungary
Duration: 4 Sep 20128 Sep 2012
Conference number: 28th

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume17
ISSN (Print)1868-8969

Conference

ConferenceInternational Conference on Logic Programming 2012
Abbreviated titleICLP 2012
CountryHungary
CityBudapest
Period4/09/128/09/12

Keywords

  • First-order logic
  • Grounding
  • IDP framework
  • Knowledge representation and reasoning
  • Model generation

Cite this