GASP: Answer Set Programming with Lazy Grounding


In this paper we present a novel methodology to compute stable models in Answer Set Programming. The process is performed with a bottom-up approach that does not require the preprocessing of the typical grounding phase. The implementation is completely in Prolog and Constraint Logic Programming over finite domains.

DOI: 10.3233/FI-2009-180

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@article{Pal2009GASPAS, title={GASP: Answer Set Programming with Lazy Grounding}, author={Alessandro Dal Pal{\`u} and Agostino Dovier and Enrico Pontelli and Gianfranco Rossi}, journal={Fundam. Inform.}, year={2009}, volume={96}, pages={297-322} }