On the Complexity of Ontological Reasoning under Disjunctive Existential Rules

  • Georg Gottlob
  • Marco Manna
  • Michael Morak
  • Andreas Pieris
Conference paper

DOI: 10.1007/978-3-642-32589-2_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7464)
Cite this paper as:
Gottlob G., Manna M., Morak M., Pieris A. (2012) On the Complexity of Ontological Reasoning under Disjunctive Existential Rules. In: Rovan B., Sassone V., Widmayer P. (eds) Mathematical Foundations of Computer Science 2012. MFCS 2012. Lecture Notes in Computer Science, vol 7464. Springer, Berlin, Heidelberg

Abstract

Ontology-based data access is an emerging yet powerful technology that allows to enhance a classical relational database with an ontology in order to infer new intensional knowledge. Recently, Datalog+/- was introduced with the purpose of providing tractable reasoning algorithms for expressive ontology languages. In this framework, Datalog is extended by features such as existential quantification in rule heads, and at the same time the rule syntax is restricted to guarantee decidability, and also tractability, of relevant reasoning tasks. In this paper, we enrich Datalog even more by allowing not only existential quantification but also disjunction in rule heads, and we investigate the complexity of reasoning under the obtained formalism.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Georg Gottlob
    • 1
    • 2
    • 3
  • Marco Manna
    • 1
    • 4
  • Michael Morak
    • 1
  • Andreas Pieris
    • 1
  1. 1.Department of Computer ScienceUniversity of OxfordUK
  2. 2.Oxford-Man Institute of Quantitative FinanceUniversity of OxfordUK
  3. 3.Institute for the Future of ComputingOxford Martin SchoolUK
  4. 4.Department of MathematicsUniversity of CalabriaItaly

Personalised recommendations