The DLV System for Knowledge Representation and Reasoning
<|reference_start|>The DLV System for Knowledge Representation and Reasoning: 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 $\Delta^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.<|reference_end|>
@article{leone2002the,
    title={The DLV System for Knowledge Representation and Reasoning},
    author={Nicola Leone, Gerald Pfeifer, Wolfgang Faber, Thomas Eiter, Georg
  Gottlob, Simona Perri, Francesco Scarcello},
    journal={ACM Transactions on Computational Logic 7(3):499-562, 2006},
    year={2002},
    doi={10.1145/1149114.1149117},
    archivePrefix={arXiv},
    eprint={cs/0211004},
    primaryClass={cs.AI cs.LO cs.PL}
}