Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity
Bienvenu, M. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2018) Ontology-mediated queries: combined complexity and succinctness of rewritings via circuit complexity. Journal of the ACM 65 (5), ISSN 0004-5411.
|
Text
HyperACM-CR.pdf - Author's Accepted Manuscript Download (1MB) | Preview |
Abstract
We give solutions to two fundamental computational problems in ontology based data access with the W3C standard ontology language OWL2 QL: the succinctness problem for first-order rewritings of ontology-mediated queries (OMQs), and the complexity problem for OMQ answering. We classify OMQs according to the shape of their conjunctive queries (treewidth, the number of leaves) and the existential depth of their ontologies. For each of these classes, we determine the combined complexity of OMQ answering, and whether all OMQs in the class have polynomial-size first-order, positive existential and nonrecursive datalog rewritings. We obtain the succinctness results using hypergraph programs, a new computational model for Boolean functions, which makes it possible to connect the size of OMQ rewritings and circuit complexity.
Metadata
| Item Type: | Article |
|---|---|
| Additional Information: | © ACM, 2018. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published at the link above. |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Roman Kontchakov |
| Date Deposited: | 19 Apr 2018 09:12 |
| Last Modified: | 09 Aug 2023 12:43 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/22094 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
 |
Edit/View Item |