## The DLV System for Knowledge Representation and Reasoning (2002)

### Cached

### Download Links

- [www.mat.unical.it]
- [www.kr.tuwien.ac.at]
- [arxiv.org]
- [arxiv.org]
- [arxiv.org]
- DBLP

### Other Repositories/Bibliography

Venue: | ACM Transactions on Computational Logic |

Citations: | 322 - 79 self |

### BibTeX

@ARTICLE{Leone02thedlv,

author = {Nicola Leone and Gerald Pfeifer and Wolfgang Faber and Thomas Eiter and Georg Gottlob and Simona Perri and Francesco Scarcello},

title = {The DLV System for Knowledge Representation and Reasoning},

journal = {ACM Transactions on Computational Logic},

year = {2002},

volume = {7},

pages = {499--562}

}

### Years of Citing Articles

### OpenURL

### Abstract

Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). 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 paper 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