Gottlob, G. and Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Schwentick, T. and Zakharyaschev, Michael (2014) The price of query rewriting in ontology-based data access. Artificial Intelligence 213 , pp. 42-59. ISSN 0004-3702.
Abstract
We give a solution to the succinctness problem for the size of first-order rewritings of conjunctive queries in ontology-based data access with ontology languages such as OWL 2 QL , linear Datalog±Datalog± and sticky Datalog±Datalog±. We show that positive existential and nonrecursive datalog rewritings, which do not use extra non-logical symbols (except for intensional predicates in the case of datalog rewritings), suffer an exponential blowup in the worst case, while first-order rewritings can grow superpolynomially unless NP⊆P/polyNP⊆P/poly. We also prove that nonrecursive datalog rewritings are in general exponentially more succinct than positive existential rewritings, while first-order rewritings can be superpolynomially more succinct than positive existential rewritings. On the other hand, we construct polynomial-size positive existential and nonrecursive datalog rewritings under the assumption that any data instance contains two fixed constants.
Metadata
| Item Type: | Article |
|---|---|
| Keyword(s) / Subject(s): | Ontology, Datalog, Conjunctive query, Query rewriting, Succinctness, Boolean circuit, Monotone complexity |
| School: | Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences |
| Depositing User: | Administrator |
| Date Deposited: | 07 May 2014 13:11 |
| Last Modified: | 09 Aug 2023 12:34 |
| URI: | https://eprints.bbk.ac.uk/id/eprint/9686 |
Statistics
Additional statistics are available via IRStats2.
Archive Staff Only (login required)
