Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries
Bienvenu, M. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2016) Theoretically optimal datalog rewritings for OWL 2 QL ontology-mediated queries. In: UNSPECIFIED (ed.) Proceedings of the 29th International Workshop on Description Logics. CEUR-WS.
|
Text
LogNDL.pdf - Author's Accepted Manuscript Download (454kB) | Preview |
Abstract
We show that, for OWL2QL ontology-mediated queries with (i) ontologies of bounded depth and conjunctive queries of bounded treewidth, (ii) ontologies of bounded depth and bounded-leaf tree-shaped conjunctive queries, and (iii) arbitrary ontologies and bounded-leaf tree-shaped conjunctive queries, one can construct and evaluate nonrecursive datalog rewritings by, respectively, LOGCFL, NL and LOGCFL algorithms, which matches the optimal combined complexity.
Metadata
| Item Type: | Book Section |
|---|---|
| Additional Information: | Cape Town, South Africa, April 22-25, 2016. ISSN: 1613-0073 |
| School: | Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 25 May 2016 14:36 |
| Last Modified: | 31 Jul 2019 21:06 |
| URI: | http://eprints.bbk.ac.uk/id/eprint/15317 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |