On the succinctness of query rewriting over shallow ontologies
On the succinctness of query rewriting over shallow ontologies
复制标题
浅层本体查询重写的简洁性
DOI:
10.1145/2603088.2603131
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Kikot S
中科院分区:
文献类型:
--
作者:
Kikot S
We investigate the succinctness problem for conjunctive query rewritings overOWL 2QLontologies 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 ⊆ 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.
登录
查看更多内容
影响因子:
14.4
作者:
Gottlob, Georg;Kikot, Stanislav;Zakharyaschev, Michael
通讯作者:
Zakharyaschev, Michael
DOI:
--
发表时间:
2014
期刊:
arXiv.org
影响因子:
--
作者:
S. Kikot;R. Kontchakov;V. Podolskii;M. Zakharyaschev
通讯作者:
M. Zakharyaschev
DOI:
10.1007/978-3-642-31585-5_26
发表时间:
2012
期刊:
ArXiv
影响因子:
--
作者:
S. Kikot;R. Kontchakov;V. Podolskii;M. Zakharyaschev
通讯作者:
M. Zakharyaschev
DOI:
10.1007/978-3-642-30284-8_31
发表时间:
2012
期刊:
Journal of the ACM (JACM)
影响因子:
--
作者:
R. Rosati
通讯作者:
R. Rosati
DOI:
--
发表时间:
2012
期刊:
Thirteenth International Conference on Principles of Knowledge Representation and Reasoning, KR 2012, Rome, Italy, June 10-14, 2012
影响因子:
--
作者:
Kikot S
通讯作者:
Kikot S