Anchor(TOC) TableOfContents


DLV-Complex: The Project

DLV-Complex is an Answer Set Programming System extending [ DLV] by means of functions. It is a very powerful ASP system supporting (recursive) functions, sets, and lists, along with libraries for their manipulations.

DLV-Complex is based on the [ DLV] system and on the [ DLV-EX] framework, from which it inherits the possibility of defining external predicates. If will find everything you need in order to create your own external predicates collected in libraries on the [ DLV-EX] page.

[#TOC Top of Page]


The Team

[#TOC Top of Page]



DLV-Complex is actively developed. To receive notifications about new releases and other important events regarding DLV-Complex, just have a look at this page, or drop us a note [mailto:calimeri{NOSPAM-at-NOSPAM} here].

Please always use the most current version of DLV-Complex (cf. [#history version history]).


Latest Version

Standard Version

We currently offer a command-line version in binary form for linux and Windows 95/98/NT/2000/XP/Vista.

Static Version

We offer also a statically linked executable, that includes list and set manipulation libraries. This version do not need any pre-installed dynamic library on your system; in addition, it is self-contained, meaning that you do not need to download any library (such as those below) in order to enjoy full lists and set support. It is ready-to-use. :) Nevertheless, this version do not support external predicates/libraries (see [ DLV-EX] page).


Latest Libraries

List-And-Set library is needed in order to exploit built-in manipulation functions/predicates for list and set terms.


Developing New External Predicates and Libraries

If will find everything you need in order to create your own external predicates (collected in dynamic libraries) on the [ DLV-EX] page.

[#TOC Top of Page]


Documentation & Examples

We provide here a quick reference guide, a short tutorial and some examples.

Documentation and examples will be updated accordingly to the evolution of the system, so check them out periodically. For a full documentation on [ DLV] please visit the official [ web page]. You might also find useful to check the official [ web page] of [ DLV-EX] out for docs and info.

Reference Guide and Tutorial

  • [attachment:dlv-complex-guide-20090407.html Reference Guide]
  • [attachment:dlv-complex-tutorial.html Tutorial]


  • [] Examples from the tutorial (text files in a .zip archive)
  • [attachment:ListPath.dl ListPath.dl] Compute all simple paths and cycles in a graph

  • [attachment:Descendants.dl Descendants.dl] Compute the set of all descendants for some given ancestors
  • [attachment:Hanoi1.dl Hanoi.dl] (txt version here: [attachment:Hanoi1.txt Hanoi.txt]) - A DLV-Complex program solving the well-known [ Tower of Hanoi Puzzle] -

  • [attachment:TuringMachine.dl TuringMachine.dl] (txt version here: [attachment:TuringMachine.txt TuringMachine.txt]) - A DLV-Complex program simulating a Turing Machine - You can dowload also a [attachment:TuringMachine.pdf more detailed description: TuringMachine.pdf] (pdf document)

[#TOC Top of Page]



  • May 19th, 2009

Improve stability. Remove some useless #MAXINT restrictions. Release a static version.

  • July 27th, 2008

Minor bugfixes (some in finite-domain checker).

  • June 13th, 2008

Improve finite-domain checker. Nicefy help messages. Several bugfixes.

  • Early 2008

First beta version.

  • Previous versions

...did not carry a real version identification.

[#TOC Top of Page]



  • F. Calimeri, S. Cozza, G. Ianni, N. Leone, "Computable Functions in ASP: Theory and Implementation", Proceedings of the 24th International Conference on Logic Programming (ICLP 2008), Vol. 5366 of Lecture Notes in Computer Science (LNCS), pp. 407-424, Udine, Italy, December 2008, Springer Verlag, GmbH Tiergartenstrasse 17, 69121, Heidelberg Germany, ISBN 978-3-540-89981-5.[ DOI]

  • F. Calimeri, S. Cozza, G. Ianni, "External Sources of Knowledge and Value Invention in Logic Programming", Annals of Mathematics and Artificial Intelligence (AMAI), Volume 50, N. 3-4, pp. 333-361, August 2007 -- [ Link to Springer Page] (find there a PDF version)

[#TOC Top of Page]

Drop us a note at [mailto:calimeri{NOSPAM-at-NOSPAM} calimeri{at}]