GASP: Answer Set Programming with Lazy Grounding

  • Authors:

  • Alessandro Dal Palù;Agostino Dovier;Enrico Pontelli;Gianfranco Rossi

  • 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

  • Venue:
  • Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

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.