Conjunctive query answering for the description logic SHIQ
Conjunctive query answering for the description logic SHIQ
复制标题
DOI：
10.1613/jair.2372
复制
发表时间：
2008-01-01
影响因子：
5
通讯作者：
Sattler, Ulrike
中科院分区：
文献类型：
--
作者：
Glimm, Birte;Horrocks, Ian;Sattler, Ulrike
连词查询是描述逻辑（DLS）的表达性查询语言的重要作用。尽管现代的DL通常提供及时的角色，但是如果在查询中录取了传递角色，则对DL知识库的结合查询只有很少的了解。在本文中，我们考虑了在突出的DL Shiq中提出的知识库的结合查询工会，并允许在查询和知识基础中及时及时角色。我们在此设置中显示查询答案的可决定性并建立两个紧密的复杂性范围：关于组合复杂性，我们证明有一种确定性算法用于查询答案，需要时间在Kb的大小上单个指数，而在kb的大小中，大小为双指数查询，这是最佳的。关于数据复杂性，我们在Co-NP中证明了遏制。
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive query answering over DL knowledge bases is only poorly understood if transitive roles are admitted in the query. In this paper, we consider unions of conjunctive queries over knowledge bases formulated in the prominent DL SHIQ and allow transitive roles in both the query and the knowledge base. We show decidability of query answering in this setting and establish two tight complexity bounds: regarding combined complexity, we prove that there is a deterministic algorithm for query answering that needs time single exponential in the size of the KB and double exponential in the size of the query, which is optimal. Regarding data complexity, we prove containment in co-NP.