Incremental Answer Set Programming with Overgrounding. Issue 5 (September 2019)

• Record Type: Journal Article
• Authors: CALIMERI, FRANCESCO; IANNI, GIOVAMBATTISTA; PACENZA, FRANCESCO; PERRI, SIMONA; ZANGARI, JESSICA
• Is Part Of: Theory and practice of logic programming. Volume 19:Issue 5/6(2019)
• Page Start: 957
• Page End: 973
• Publication Date: 2019-09
• Subjects: Knowledge Representation, -- Answer Set Programming, -- Stream Reasoning, -- Grounding, -- Instantiation of Logic Programs, -- Overgrounding; Logic programming -- Periodicals; Artificial intelligence -- Computer programs -- Periodicals; Constraint programming (Computer science) -- Periodicals; 005.115
• DOI: 10.1017/S1471068419000292
• Languages: English
• ISSNs: 1471-0684

Abstract

Abstract: Repeated executions of reasoning tasks for varying inputs are necessary in many applicative settings, such as stream reasoning. In this context, we propose an incremental grounding approach for the answer set semantics. We focus on the possibility of generating incrementally larger ground logic programs equivalent to a given non-ground one; so called overgrounded programs can be reused in combination with deliberately many different sets of inputs. Updating overgrounded programs requires a small effort, thus making the instantiation of logic programs considerably faster when grounding is repeated on a series of inputs similar to each other. Notably, the proposed approach works "under the hood", relieving designers of logic programs from controlling technical aspects of grounding engines and answer set systems. In this work we present the theoretical basis of the proposed incremental grounding technique, we illustrate the consequent repeated evaluation strategy and report about our experiments.