Conjunctive Query Inseparability of OWL 2 QL TBoxes

Authors

  • Boris Konev University of Liverpool
  • Roman Kontchakov Birkbeck College London
  • Michel Ludwig University of Liverpool
  • Thomas Schneider University of Bremen
  • Frank Wolter University of Liverpool
  • Michael Zakharyaschev Birkbeck College London

DOI:

https://doi.org/10.1609/aaai.v25i1.7846

Abstract

The OWL 2 profile OWL 2 QL, based on the DL-Lite family of description logics, is emerging as a major language for developing new ontologies and approximating the existing ones. Its main application is ontology-based data access, where ontologies are used to provide background knowledge for answering queries over data. We investigate the corresponding notion of query inseparability (or equivalence) for OWL 2 QL ontologies and show that deciding query inseparability is PSPACE-hard and in EXPTIME. We give polynomial time (incomplete) algorithms and demonstrate by experiments that they can be used for practical module extraction.

Downloads

Published

2011-08-04

How to Cite

Konev, B., Kontchakov, R., Ludwig, M., Schneider, T., Wolter, F., & Zakharyaschev, M. (2011). Conjunctive Query Inseparability of OWL 2 QL TBoxes. Proceedings of the AAAI Conference on Artificial Intelligence, 25(1), 221-226. https://doi.org/10.1609/aaai.v25i1.7846

Issue

Vol. 25 No. 1 (2011): Twenty-Fifth AAAI Conference on Artificial Intelligence

Section

AAAI Technical Track: Knowledge Representation and Reasoning