On the succinctness of query rewriting over shallow ontologies

Kikot, Stanislav and Kontchakov, Roman and Podolskii, V. and Zakharyaschev, Michael (2014) On the succinctness of query rewriting over shallow ontologies. In: Henzinger, T. and Miller, D. (eds.) CSL-LICS '14 Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). New York, U.S.: ACM, 57:1-57:10. ISBN 9781450328869.

Abstract

We investigate the succinctness problem for conjunctive query rewritings over OWL2QL ontologies of depth 1 and 2 by means of hypergraph programs computing Boolean functions. Both positive and negative results are obtained. We show that, over ontologies of depth 1, conjunctive queries have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial positive existential rewritings; however, in the worst case, positive existential rewritings can be superpolynomial. Over ontologies of depth 2, positive existential and nonrecursive datalog rewritings of conjunctive queries can suffer an exponential blowup, while first-order rewritings can be superpolynomial unless NP �is included in P/poly. We also analyse rewritings of tree-shaped queries over arbitrary ontologies and note that query entailment for such queries is fixed-parameter tractable.

Metadata

Statistics

DownloadsShow export options

Export as XMLJSONCSV

Activity Overview

6 month trend

427Downloads

6 month trend

359Hits

Additional statistics are available via IRStats2.

Archive Staff Only (login required)

Edit/View Item