DLV-Complex

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.

References in zbMATH (referenced in 5 articles )

Showing results 1 to 5 of 5.
Sorted by year (citations)

  1. Calimeri, Francesco; Cozza, Susanna; Ianni, Giovambattista; Leone, Nicola: Magic sets for the bottom-up evaluation of finitely recursive programs (2009)
  2. Calimeri, Francesco; Cozza, Susanna; Ianni, Giovambattista; Leone, Nicola: An ASP system with functions, lists, and sets (2009) ioport
  3. Fiorentini, Camillo; Momigliano, Alberto; Ornaghi, Mario: Towards a type discipline for answer set programming (2009)
  4. Ornaghi, Mario; Fiorentini, Camillo; Momigliano, Alberto; Pagano, Francesco: Applying ASP to UML model validation (2009) ioport
  5. Calimeri, Francesco; Cozza, Susanna; Ianni, Giovambattista; Leone, Nicola: Computable functions in ASP: Theory and implementation (2008)