Rewriting Conjunctive Queries over Description Logic Knowledge Bases

  • Héctor Pérez-Urbina
  • Boris Motik
  • Ian Horrocks
Conference paper

DOI: 10.1007/978-3-540-88594-8_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4925)
Cite this paper as:
Pérez-Urbina H., Motik B., Horrocks I. (2008) Rewriting Conjunctive Queries over Description Logic Knowledge Bases. In: Schewe KD., Thalheim B. (eds) Semantics in Data and Knowledge Bases. SDKB 2008. Lecture Notes in Computer Science, vol 4925. Springer, Berlin, Heidelberg

Abstract

We consider the problems of conjunctive query answering and rewriting for information integration systems in which a Description Logic ontology is used to provide a global view of the data. We present a resolution-based query rewriting algorithm for DL-Lite +  ontologies, and use it to show that query answering in this setting is NLogSpace-complete with respect to data complexity. We also show that our algorithm produces an optimal rewriting when the input ontology is expressed in the language DL-Lite. Finally, we sketch an extended version of the algorithm that would, we are confident, be optimal for several DL languages with data complexity of query answering ranging from LogSpace to PTime-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Héctor Pérez-Urbina
    • 1
  • Boris Motik
    • 1
  • Ian Horrocks
    • 1
  1. 1.Computing LaboratoryUniversity of OxfordOxfordUK

Personalised recommendations