基于浅追踪的OWL 2 QL本体查询重写的简洁性
On the Succinctness of Query Rewriting over OWL 2 QL Ontologies with Shallow Chases
摘要:
我们调查的规模一阶重写的合取查询OWL 2 QL本体的深度1和2的超图程序计算布尔函数。得到了肯定和否定的结果。深度为1的本体上的合取查询具有多项式大小的非递归数据重写;树形查询具有多项式正存在重写;然而,在最坏的情况下,正存在重写只能具有超多项式大小。在最坏的情况下,深度为2的本体上的查询的正存在和非递归数据库重写遭受指数爆破,而一阶重写是超多项式的,除非$\text{NP} \subseteq \text{P}/\text{poly}$。我们还分析重写任意本体的树形查询,并观察到这种查询的查询蕴涵问题是固定参数易处理的。
英文摘要:
We investigate the size of first-order rewritings of conjunctive queries over OWL 2 QL ontologies of depth 1 and 2 by means of hypergraph programs computing Boolean functions. Both positive and negative results are obtained. Conjunctive queries over ontologies of depth 1 have polynomial-size nonrecursive datalog rewritings; tree-shaped queries have polynomial positive existential rewritings; however, in the worst case, positive existential rewritings can only be of superpolynomial size. Positive existential and nonrecursive datalog rewritings of queries over ontologies of depth 2 suffer an exponential blowup in the worst case, while first-order rewritings are superpolynomial unless $\text{NP} \subseteq \text{P}/\text{poly}$. We also analyse rewritings of tree-shaped queries over arbitrary ontologies and observe that the query entailment problem for such queries is fixed-parameter tractable.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。