Skip to main content
    • Aa
    • Aa

Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues


Datalog is one of the best-known rule-based languages, and extensions of it are used in a wide context of applications. An important Datalog extension is Disjunctive Datalog, which significantly increases the expressivity of the basic language. Disjunctive Datalog is useful in a wide range of applications, ranging from Databases (e.g., Data Integration) to Artificial Intelligence (e.g., diagnosis and planning under incomplete knowledge). However, in recent years an important shortcoming of Datalog-based languages became evident, e.g. in the context of data-integration (consistent query-answering, ontology-based data access) and Semantic Web applications: The language does not permit any generation of and reasoning with unnamed individuals in an obvious way. In general, it is weak in supporting many cases of existential quantification. To overcome this problem, Datalog has recently been proposed, which extends traditional Datalog by existential quantification in rule heads. In this work, we propose a natural extension of Disjunctive Datalog and Datalog, called Datalog∃,˅, which allows both disjunctions and existential quantification in rule heads and is therefore an attractive language for knowledge representation and reasoning, especially in domains where ontology-based reasoning is needed. We formally define syntax and semantics of the language Datalog∃,˅, and provide a notion of instantiation, which we prove to be adequate for Datalog∃,˅. A main issue of Datalog and hence also of Datalog∃,˅ is that decidability is no longer guaranteed for typical reasoning tasks. In order to address this issue, we identify many decidable fragments of the language, which extend, in a natural way, analog classes defined in the non-disjunctive case. Moreover, we carry out an in-depth complexity analysis, deriving interesting results which range from Logarithmic Space to Exponential Time.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

H. Andréka , I. Németi and Benthem, J. Van 1998. Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217274.

D. Calvanese , G. Giacomo , D. Lembo , M. Lenzerini and R. Rosati 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automatic Reasoning 39, 385429.

C. Chekuri and A. Rajaraman 2000. Conjunctive query containment revisited. Theoretical Computer Science 239, 2, 211229.

T. Eiter , W. Faber , N. Leone , G. Pfeifer and A. Polleres 2004. A logic programming approach to knowledge-state planning: Semantics and complexity. ACM TOCL 5, 2, 206263.

T. Eiter , G. Gottlob and H. Mannila 1997. Disjunctive datalog. ACM TODS 22, 3, 364418.

R. Fagin , P. G. Kolaitis , R. J. Miller and L. Popa 2005. Data exchange: Semantics and query answering. TCS 336, 1, 89124.

P. Ferraris , J. Lee and V. Lifschitz 2011. Stable models and circumscription. Artificial Intelligence 175, 1, 236263.

D. Johnson and A. Klug 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28, 1, 167189.

D. Maier , A. O. Mendelzon and Y. Sagiv 1979. Testing implications of data dependencies. ACM TODS 4, 4, 455469.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 85 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 24th June 2017. This data will be updated every 24 hours.