GASP: Answer Set Programming with Lazy Grounding

Issue title: Advances in Computational Logic (CIL C08)

Article type: Research Article

Authors: Dal Palù, Alessandro | Dovier, Agostino | Pontelli, Enrico | Rossi, Gianfranco

Affiliations: Dipartimento di Matematica, University of Parma, Italy. E-mail: alessandro.dalpalu@unipr.it | Dipartimento di Matematica e Informatica, University of Udine, Italy. E-mail: dovier@dimi.uniud.it | Dept. Computer Science, New Mexico State University, Mexico. E-mail: epontell@cs.nmsu.edu | Dipartimento di Matematica, University of Parma, Italy. E-mail: gianfranco.rossi@unipr.it

Abstract: In recent years, Answer Set Programming has gained popularity as a viable paradigm for applications in knowledge representation and reasoning. This paper presents a novel methodology to compute answer sets of an answer set program. The proposed methodology maintains a bottom-up approach to the computation of answer sets (as in existing systems), but it makes use of a novel structuring of the computation, that originates from the non-ground version of the program. Grounding is lazily performed during the computation of the answer sets. The implementation has been realized using Constraint Logic Programming over finite domains.

Keywords: Answer set programming, logic programming, non-monotonic reasoning

DOI: 10.3233/FI-2009-180

Journal: Fundamenta Informaticae, vol. 96, no. 3, pp. 297-322, 2009