Inproceedings,

Rewriting Conjunctive Queries over Description Logic Knowledge Bases

, , and .
Semantics in Data and Knowledge Bases, volume 4925 of Lecture Notes in Computer Science, page 199--214. Springer Berlin / Heidelberg, (2008)
DOI: 10.1007/978-3-540-88594-8_11

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 isNLogSpace-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 fromLogSpacetoPTime-complete.

Tags

Users

  • @alexjdl

Comments and Reviews