Conjunctive Query Inseparability of OWL 2 QL TBoxes

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.

Cite

Text

Konev et al. "Conjunctive Query Inseparability of OWL 2 QL TBoxes." AAAI Conference on Artificial Intelligence, 2011. doi:10.1609/AAAI.V25I1.7846

Markdown

[Konev et al. "Conjunctive Query Inseparability of OWL 2 QL TBoxes." AAAI Conference on Artificial Intelligence, 2011.](https://mlanthology.org/aaai/2011/konev2011aaai-conjunctive/) doi:10.1609/AAAI.V25I1.7846

BibTeX

@inproceedings{konev2011aaai-conjunctive,
  title     = {{Conjunctive Query Inseparability of OWL 2 QL TBoxes}},
  author    = {Konev, Boris and Kontchakov, Roman and Ludwig, Michel and Schneider, Thomas and Wolter, Frank and Zakharyaschev, Michael},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2011},
  pages     = {221-226},
  doi       = {10.1609/AAAI.V25I1.7846},
  url       = {https://mlanthology.org/aaai/2011/konev2011aaai-conjunctive/}
}