10.4230/LIPICS.ICLP.2012.49
Balduccini, Marcello
Marcello
Balduccini
An Answer Set Solver for non-Herbrand Programs: Progress Report
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
2012
Article
Answer Set Programming
non-Herbrand Functions
Answer Set Solving
Knowledge Representation and Reasoning
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
2012
2012-09-05
2012-09-05
2012-09-05
en
urn:nbn:de:0030-drops-36099
10.4230/LIPIcs.ICLP.2012
978-3-939897-43-9
1868-8969
10.4230/LIPIcs.ICLP.2012
LIPIcs, Volume 17, ICLP 2012
Technical Communications of the 28th International Conference on Logic Programming (ICLP'12)
2013
17
6
49
60
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dovier, Agostino
Agostino
Dovier
Costa, Vítor Santos
Vítor Santos
Costa
1868-8969
Leibniz International Proceedings in Informatics (LIPIcs)
2012
17
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
12 pages
451117 bytes
application/pdf
Creative Commons Attribution-NoDerivs 3.0 Unported license
info:eu-repo/semantics/openAccess
In this paper we propose an extension of Answer Set Programming (ASP) by non-Herbrand functions, i.e. functions over non-Herbrand domains, and describe a solver for the new language. Our approach stems for our interest in practical applications, and from the corresponding need to compute the answer sets of programs with non-Herbrand functions efficiently. Our extension of ASP is such that the semantics of the new language is obtained by a comparatively small change to the ASP semantics from [8]. This makes it possible to modify a state-of-the-art ASP solver in an incremental fashion, and use it for the computation of the answer sets of (a large class of) programs of the new language. The computation is rather efficient, as demonstrated by our experimental evaluation.
LIPIcs, Vol. 17, Technical Communications of the 28th International Conference on Logic Programming (ICLP'12), pages 49-60