Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of the ACM (JACM) Year : 2018

Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity

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.
Fichier principal
Vignette du fichier
HyperACM-CR.pdf (1.35 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01892661 , version 1 (10-10-2018)

Identifiers

Cite

Meghyn Bienvenu, Stanislav Kikot, Roman Kontchakov, Vladimir V Podolskii, Michael Zakharyaschev. Ontology-Mediated Queries: Combined Complexity and Succinctness of Rewritings via Circuit Complexity. Journal of the ACM (JACM), 2018, 65 (5), pp.1-51. ⟨10.1145/3191832⟩. ⟨lirmm-01892661⟩
283 View
208 Download

Altmetric

Share

Gmail Facebook X LinkedIn More