We present DLV-Complex, an extension of the DLV system that features the support for a powerful (possibly recursive) use of functions, list and set terms in the full ASP language with disjunction and negation. Any computable function can be encoded in a rich and fully declarative KRR language, ensuring termination on all programs belonging to the recently introduced class of finitely-ground programs; furthermore, termination can be "a priori" guaranteed on demand by means of a syntactic restriction check that ensures a finite-domain property. The system, which is already successfully used in many universities and research institutes, comes also equipped with a rich library of built-in functions and predicates for the manipulation of complex terms. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Calimeri, F., Cozza, S., Ianni, G., & Leone, N. (2009). An ASP system with functions, lists, and sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5753 LNAI, pp. 483–489). https://doi.org/10.1007/978-3-642-04238-6_46
Mendeley helps you to discover research relevant for your work.