Author:
Bienvenu Meghyn,Kikot Stanislav,Kontchakov Roman,Podolskii Vladimir V.,Zakharyaschev Michael
Abstract
We give solutions to two fundamental computational problems in ontology-based data access with the W3C standard ontology language
OWL 2 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.
Funder
ANR JCJC France
President of Russian Federation
EPSRC UK
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference89 articles.
1. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley.
2. Reducing the complexity of reductions
3. Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
4. The monotone circuit complexity of boolean functions
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献