2197
Comment: First version. Check it out.
|
4546
|
Deletions are marked like this. | Additions are marked like this. |
Line 2: | Line 2: |
---- | |
Line 6: | Line 7: |
---- | |
Line 9: | Line 11: |
DLV-Complex is an Answer Set Programming System extending [http://www.dlvsystem.com DLV] by means of by functions. It is a very powerful ASP system supporting (recursive) functions, sets, and lists, along with libraries for their manipulations. | DLV-Complex is an Answer Set Programming System extending [http://www.dlvsystem.com DLV] by means of functions. It is a very powerful ASP system supporting (recursive) functions, sets, and lists, along with libraries for their manipulations. |
Line 13: | Line 15: |
---- | |
Line 19: | Line 21: |
== Core == | * [http://www.mat.unical.it/calimeri Francesco Calimeri] * [mailto:cozza{NOSPAM-at-NOSPAM}mat.unical.it Susanna Cozza] * [http://www.gibbi.com Giovambattista Ianni] * [http://www.mat.unical.it/~leone Nicola Leone] |
Line 21: | Line 26: |
[http://www.mat.unical.it/calimeri Francesco Calimeri], [mailto:cozza[AT]mat.unical.it Susanna Cozza], [http://www.gibbi.com Giovambattista Ianni], [http://www.mat.unical.it/~leone Nicola Leone] |
---- |
Line 26: | Line 29: |
[[Anchor(download)]] = Download = |
[[Anchor(downloads)]] = Downloads = |
Line 29: | Line 32: |
DLV-Complex is actively developed. To receive notifications about new releases and other important events regarding DLV-EX, just have a look at this page, or drop us a note [mailto:dlv-ex@mat.unical.it here]. | 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}mat.unical.it here]. |
Line 31: | Line 34: |
Please always use the most current version of DLV-EX (cf. [#history version history]). | Please always use the most current version of DLV-Complex (cf. [#history version history]). |
Line 37: | Line 40: |
Binaries will be available here soon. Check this page out often for new releases. | We currently offer a command-line version in binary form for linux and Windows 95/98/NT/2000/XP/Vista. |
Line 39: | Line 42: |
* Download latest [attachment:dl-complex.linux.20080727.beta linux version] * Download latest [attachment:dl-complex.win.20080727.exe windows version] |
|
Line 40: | Line 45: |
== Latest Libraries == List-And-Set library is needed in order to exploit built-in manipulation functions/predicates for list and set terms. * Download latest [attachment:ListAndSet.so linux version] (.so) * Download latest [attachment:ListAndSet.dll windows version] (.dll) ---- |
|
Line 45: | Line 58: |
We will provide soon provide an online manual and a online tutorial; they will be updated accordingly to the evolution of the system, so check them periodically. | We provide here a quick reference guide, a short tutorial and some examples. |
Line 47: | Line 60: |
For a full documentation on DLV please check the official [http://www.dlvsystem.com web page]. | Documentation and examples will be updated accordingly to the evolution of the system, so check them out periodically. For a full documentation on [http://www.dlvsystem.com DLV] please visit the official [http://www.dlvsystem.com web page]. You might also find useful to check the official [http://www.mat.unical.it/ianni/wiki/dlvex web page] of [http://www.mat.unical.it/ianni/wiki/dlvex DLV-EX] out for docs and info. |
Line 49: | Line 62: |
Check the official [http://www.mat.unical.it/ianni/wiki/dlvex web page] of DLV-EX out for docs and info. | == Reference Guide and Tutorial == * [attachment:dlv-complex-guide.html Reference Guide] * [attachment:dlv-complex-tutorial.html Tutorial] == Examples == * [attachment:tutorial-examples.zip Tutorial-examples.zip] 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 [http://en.wikipedia.org/wiki/Tower_of_Hanoi 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 find a more detailed description [attachment:TuringMachine.pdf here (TuringMachine.pdf)] (pdf document) |
Line 57: | Line 84: |
* June 2008 Available soon. |
* 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. |
Line 63: | Line 96: |
---- | |
Line 66: | Line 100: |
= Selected Publications = | = Reports = |
Line 68: | Line 102: |
Some selected publications will be listed here. | * F. Calimeri, S. Cozza, G. Ianni, N. Leone, "''Computable Functions in ASP: Theory and Implementation''" - Technical paper - unpublished. [attachment:cali-etal-2008-functions.pdf Download the paper as PDF] * 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 -- [http://www.springerlink.com/content/54hw76l157856964/ Link to Springer Page] (find there a PDF version) |
Line 70: | Line 105: |
---- | |
Line 72: | Line 109: |
__''[mailto:dlv-ex@mat.unical.it dlv-ex@mat.unical.it]''__ | Drop us a note at __''[mailto:calimeri{NOSPAM-at-NOSPAM}mat.unical.it calimeri{at}mat.unical.it]''__ |
DLV-Complex: The Project
DLV-Complex is an Answer Set Programming System extending [http://www.dlvsystem.com 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 [http://www.dlvsystem.com DLV] system and on the [http://www.mat.unical.it/ianni/wiki/dlvex DLV-EX] framework.
[#TOC Top of Page]
The Team
[http://www.mat.unical.it/calimeri Francesco Calimeri]
[mailto:cozza{NOSPAM-at-NOSPAM}mat.unical.it Susanna Cozza]
[http://www.gibbi.com Giovambattista Ianni]
[http://www.mat.unical.it/~leone Nicola Leone]
[#TOC Top of Page]
Downloads
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}mat.unical.it here].
Please always use the most current version of DLV-Complex (cf. [#history version history]).
Latest Version
We currently offer a command-line version in binary form for linux and Windows 95/98/NT/2000/XP/Vista.
- Download latest [attachment:dl-complex.linux.20080727.beta linux version]
- Download latest [attachment:dl-complex.win.20080727.exe windows version]
Latest Libraries
List-And-Set library is needed in order to exploit built-in manipulation functions/predicates for list and set terms.
Download latest [attachment:ListAndSet.so linux version] (.so)
Download latest [attachment:ListAndSet.dll windows version] (.dll)
[#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 [http://www.dlvsystem.com DLV] please visit the official [http://www.dlvsystem.com web page]. You might also find useful to check the official [http://www.mat.unical.it/ianni/wiki/dlvex web page] of [http://www.mat.unical.it/ianni/wiki/dlvex DLV-EX] out for docs and info.
Reference Guide and Tutorial
- [attachment:dlv-complex-guide.html Reference Guide]
- [attachment:dlv-complex-tutorial.html Tutorial]
Examples
- [attachment:tutorial-examples.zip Tutorial-examples.zip] 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 [http://en.wikipedia.org/wiki/Tower_of_Hanoi 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 find a more detailed description [attachment:TuringMachine.pdf here (TuringMachine.pdf)] (pdf document)
[#TOC Top of Page]
History
- 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]
Reports
F. Calimeri, S. Cozza, G. Ianni, N. Leone, "Computable Functions in ASP: Theory and Implementation" - Technical paper - unpublished. [attachment:cali-etal-2008-functions.pdf Download the paper as PDF]
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 -- [http://www.springerlink.com/content/54hw76l157856964/ Link to Springer Page] (find there a PDF version)
[#TOC Top of Page]
Drop us a note at [mailto:calimeri{NOSPAM-at-NOSPAM}mat.unical.it calimeri{at}mat.unical.it]