Abstract
DLV is an efficient Answer Set Programming (ASP) system implementing the (consistent) answer set semantics [GL91] with various language extensions like weak constraints [BLR00], queries, and built-in predicates. A strong point of DLV is the high expressiveness of its language, which is able to express very complex problems, even problems which are hard for the complexity class \(\Delta_3^P\). The language of DLV is therefore strictly more expressive than normal logic programming which cannot express any problem beyond NP. Another strong point of DLV is its robust and efficient implementation, which integrates algorithms and heuristics from the field of nonmonotonic reasoning with several optimization techniques from the field of deductive databases.
The work was partially supported by the European Commission under projects IST-2002-33570 INFOMIX, IST-2001-32429 ICONS, and IST-2001-37004 WASP.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Buccafurri, F., Leone, N., Rullo, P.: Enhancing Disjunctive Datalog by Constraints. IEEE TKDE 12(5) (2000)
Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Aggregate Functions in Disjunctive Logic Programming: Semantics, Complexity, and Implementation in DLV. In: IJCAI 2003, Acapulco, Mexico, August 2003, Morgan Kaufmann, San Francisco (2003)
Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Pfeifer, G.: Semantics and Computation of Aggregate Functions in Disjunctive Logic Programming. Tech. Report INFSYS RR-1843-03-07, TUWien (April 2003)
Dowling, W.F., Gallier, J.H.: Linear-time Algorithms for Testing the Satisfability of Propositional Horn Formulae. JLP 3, 267–284 (1984)
Faber, W., Leone, N., Pfeifer, G.: Pushing Goal Derivation in DLP Computations. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 177–191. Springer, Heidelberg (1999)
Gelfond, M., Lifschitz, V.: Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing 9, 365–385 (1991)
Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. Tech. Report cs.AI/0211004,arXiv.org (November 2002) (submitted to ACM TOCL)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dell’Armi, T., Faber, W., Ielpa, G., Leone, N., Perri, S., Pfeifer, G. (2003). System Description: DLV with Aggregates. In: Lifschitz, V., Niemelä, I. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2004. Lecture Notes in Computer Science(), vol 2923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24609-1_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-24609-1_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20721-4
Online ISBN: 978-3-540-24609-1
eBook Packages: Springer Book Archive