Kontchakov, Roman and Ryzhikov, Vladislav and Zakharyaschev, Michael (2013) Conjunctive query inseparability in OWL2QL is ExpTime-hard. In: Eiter, T. and Glimm, B. and Kazakov, Y. and Krötzsch, M. (eds.) Informal Proceedings of DL (Ulm, 23-26 July). CEUR Workshop Proceedings 1014. CEUR-WS, pp. 353-363.
|
Text
ExpTime.pdf - Author's Accepted Manuscript Download (333kB) | Preview |
Abstract
We settle an open question on the complexity of the following problem: given two OWL2QL TBoxes and a signature, decide whether these TBoxes return the same answers to any conjunctive query over any data formulated in the given signature. It has been known that the complexity of this problem is between PSpace and ExpTime. Here we show that the problem is ExpTime-complete and, in fact, deciding whether two OWL2QL knowledge bases (each with its own data) give the same answers to any conjunctive query is ExpTime-hard.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | DL 2013 - Informal Proceedings of the 26th International Workshop on Description Logics - Ulm, Germany, July 23 - 26, 2013 - Series ISSN: 1613-073 |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 01 Aug 2014 14:47 |
| Last Modified: | 09 Aug 2023 12:35 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/10305 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
