The disjunctive datalog system DLV

66Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

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 DLV DB , 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. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Alviano, M., Faber, W., Leone, N., Perri, S., Pfeifer, G., & Terracina, G. (2011). The disjunctive datalog system DLV. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6702 LNCS, pp. 282–301). https://doi.org/10.1007/978-3-642-24206-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free