The DOI matches its Crossref record; 66 of the 66 references it cites were found in a registry or an index.
The DLV system for knowledge representation and reasoning
Open accessAbstract
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of finite structures that is decidable in the complexity class Σ P 2 (NP NP ). Thus, under widely believed assumptions, DLP is strictly more expressive than normal ( disjunction-free ) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing problems of lower complexity in a simpler and more natural fashion.This article presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog ), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to Δ P 3 -complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof.Furthermore, we illustrate the general architecture of the DLV system, which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1988) · Cited by 3,452
A theory of diagnosis from first principles
Reiter, R. (1987) · Artificial Intelligence · doi:10.1016/0004-3702(87)90062-2 · Cited by 3,031
Proceedings of the 16th international joint conference on Artificial Intelligence - IJCAI '99
Colton, S., Bundy, A., & Walsh, T. (1999) · Cited by 2,500
Classical negation in logic programs and disjunctive databases
Gelfond, M., & Lifschitz, V. (1991) · New Generation Computing · doi:10.1007/bf03037169 · Cited by 2,259
Clark, K. L. (1978) · Logic and Data Bases · doi:10.1007/978-1-4684-3384-5_11 · Cited by 2,000
The well-founded semantics for general logic programs
Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991) · Journal of the ACM · doi:10.1145/116825.116838 · Cited by 1,652
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,413
Towards a Theory of Declarative Knowledge
Apt, K. R., Blair, H. A., & Walker, A. (1988) · Foundations of Deductive Databases and Logic Programming · doi:10.1016/b978-0-934613-40-8.50006-3 · Cited by 1,151
Foundations of Deductive Databases and Logic Programming
(1988) · Elsevier eBooks · doi:10.1016/c2013-0-07699-2 · Cited by 974
Stanford GraphBase: A Platform for Combinatorial Computing, The
Knuth, D. E. (1993) · Cited by 927
Cited by
Conflict-driven answer set solving: From theory to practice
Gebser, M., Kaufmann, B., & Schaub, T. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.04.001 · Cited by 327
Multi-shot ASP solving with clingo
GEBSER, M., KAMINSKI, R., KAUFMANN, B., & SCHAUB, T. (2019) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000054 · Cited by 309
A comparison of security requirements engineering methods
Fabian, B., Gürses, S., Heisel, M., Santen, T., & Schmidt, H. (2010) · Requirements Engineering · doi:10.1007/s00766-009-0092-x · Cited by 239
Clingo = ASP + Control: Preliminary Report
Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2014) · arXiv · doi:10.48550/arxiv.1405.3694 · Cited by 230
Metadata
- Authors
- Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F.
- Venue
- ACM Transactions on Computational Logic
- Published
- 2006-07
- Volume
- 7
- Issue
- 3
- Pages
- 499-562
- ISSN
- 1529-3785 (ISSN-L)
- 1557-945X
- OpenAlex
- W1976055110
- Cited by
- 1,151
- References
- 66
- FWCI
- 101.42
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The DLV system for knowledge representation and reasoning. https://app.cochat.ai/papers/10.1145/1149114.1149117
- The paper
- Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006). The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic. https://doi.org/10.1145/1149114.1149117
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.