## Bounds in Ontology-Based Data Access via Circuit Complexity

- Vladimir V. Podolskii
- Theory of Computing Systems
- 2016

11 Excerpts

- Published 2016 in ArXiv

We give solutions to two fundamental computational problems in ontologybased data access with the W3C standard ontology language OWL2QL: 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.

@article{Bienvenu2016OntologyMediatedQC,
title={Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity},
author={Meghyn Bienvenu and Stanislav Kikot and Roman Kontchakov and Vladimir V. Podolskii and Michael Zakharyaschev},
journal={CoRR},
year={2016},
volume={abs/1605.01207}
}