The disjunctive datalog system DLV

  • Authors:
  • Mario Alviano;Wolfgang Faber;Nicola Leone;Simona Perri;Gerald Pfeifer;Giorgio Terracina

  • Affiliations:
  • Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy;Department of Mathematics, University of Calabria, Rende, CS, Italy

  • Venue:
  • Datalog'10 Proceedings of the First international conference on Datalog Reloaded
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

DLV is one of the most successful and widely used answer set programming (ASP) systems. It supports a powerful language extending Disjunctive Datalog with many expressive constructs, including aggregates, strong and weak constraints, functions, lists, and sets. The system provides database connectivity offering a simple way for powerful reasoning on top of relational databases. In this paper, we provide an ample overview of the DLV system. We illustrate its input language and give indications on how to use it for representing knowledge. We also provide a panorama on the system architecture and the main optimizations it incorporates. We then focus on DLVDB, an extension of the basic system which allows for tight coupling with traditional database systems. Finally, we report on a number industrial applications which rely on DLV.