The Semantic Web pp 310-323

Conjunctive Queries for a Tractable Fragment of OWL 1.1

  • Markus Krötzsch
  • Sebastian Rudolph
  • Pascal Hitzler
Conference paper

DOI: 10.1007/978-3-540-76298-0_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4825)
Cite this paper as:
Krötzsch M., Rudolph S., Hitzler P. (2007) Conjunctive Queries for a Tractable Fragment of OWL 1.1. In: Aberer K. et al. (eds) The Semantic Web. Lecture Notes in Computer Science, vol 4825. Springer, Berlin, Heidelberg

Abstract

Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries—namely conjunctive ones—can be used in conjunction with OWL such that one of the major design criteria of the latter—namely decidability—can be retained. More precisely, we show that querying the tractable fragment \(\mathcal{EL}^{\mathord{+}\mathord{+}}\) of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted \(\mathcal{EL}^{\mathord{+}\mathord{+}}\) is undecidable.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Markus Krötzsch
    • 1
  • Sebastian Rudolph
    • 1
  • Pascal Hitzler
    • 1
  1. 1.Institut AIFB, Universität KarlsruheGermany

Personalised recommendations