An Answer Set Solver for non-Herbrand Programs: Progress Report

Author Marcello Balduccini

Thumbnail PDF


  • Filesize: 440 kB
  • 12 pages

Document Identifiers

Author Details

Marcello Balduccini

Cite AsGet BibTex

Marcello Balduccini. An Answer Set Solver for non-Herbrand Programs: Progress Report. In Technical Communications of the 28th International Conference on Logic Programming (ICLP'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 17, pp. 49-60, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • Answer Set Programming
  • non-Herbrand Functions
  • Answer Set Solving
  • Knowledge Representation and Reasoning


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads