Botoeva, E. and Kontchakov, Roman and Ryzhikov, Vladislav and Wolter, F. and Zakharyaschev, Michael (2014) Query inseparability by games. In: Bienvenu, M. and Ortiz, M. and Rosati, R. and Simkus, M. (eds.) Informal Proceedings of DL (Vienna, 17-20 July). CEUR Workshop Proceedings 1193. CEUR, pp. 83-95.
|
Text
DL2014-final.pdf - Author's Accepted Manuscript Download (349kB) | Preview |
Abstract
We investigate conjunctive query inseparability of description logic knowledge bases (KBs) with respect to a given signature, a fundamental problem for KB versioning, module extraction, forgetting and knowledge exchange. We develop a game-theoretic technique for checking query inseparability of KBs expressed in fragments of Horn-ALCHI, and show a number of complexity results ranging from P to ExpTime and 2ExpTime. We also employ our results to resolve two major open problems for OWL 2 QL 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: | Informal Proceedings of the 27th International Workshop on Description Logics - Vienna, Austria, July 17-20, 2014. - Series ISSN: 1613-073 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 11 Aug 2014 09:54 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10351 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
