Botoeva, E. and Kontchakov, Roman and Ryzhikov, Vladislav and Wolter, F. and Zakharyaschev, Michael (2014) Query inseparability for description logic knowledge bases. In: Baral, C. and De Giacomo, G. and Eiter, T. (eds.) Proceedings, Fourteenth International Conference on Principles of Knowledge Representation and Reasoning (KR-14). California, U.S.: AAAI Press. ISBN 9781577356578.
![[img]](https://eprints.bbk.ac.uk/style/images/fileicons/text.png) |
Text
KR2014-full.pdf - Author's Accepted Manuscript Restricted to Repository staff only Download (625kB) | Request a copy |
Abstract
We investigate conjunctive query inseparability of description logic (DL) knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We study the data and combined complexity of deciding KB query inseparability for fragments of Horn-ALCHI, including the DLs underpinning OWL 2 QL and OWL 2 EL. While all of these DLs are P-complete for data complexity, the combined complexity ranges from P to ExpTime and 2ExpTime. We also resolve two major open problems for OWL2QL by showing that TBox query inseparability and the membership problem for universal UCQ-solutions in knowledge exchange are both ExpTime-complete for combined complexity.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | 14th International Conference on Principles of Knowledge Representation and Reasoning - Vienna University of Technology, Gußhausstraße 29, Austria. July 20-24, 2014. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 11 Aug 2014 08:22 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10354 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
