An Update Front-End for Extended Logic Programs

Eiter, Thomas; Fink, Michael; Sabbatini, Giuliana; Tompits, Hans

doi:10.1007/3-540-45402-0_30

Cited by 2 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. , n}, is described in [Eiter et al 2001e]. The semantics of P, defined in [Eiter et al 2002c], extends standard answer sets for a single program (n = 1).…”

Section: External Front-endsmentioning

confidence: 99%

The DLV system for knowledge representation and reasoning

Leone

Pfeifer

Faber

et al. 2006

ACM Trans. Comput. Logic

Self Cite

835

725

View full text Add to dashboard Cite

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 500 • N. Leone et al.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.

show abstract

“…. , n}, is described in [Eiter et al 2001e]. The semantics of P, defined in [Eiter et al 2002c], extends standard answer sets for a single program (n = 1).…”

Section: External Front-endsmentioning

confidence: 99%