Towards Farsighted Dependencies for Existential Rules
Towards Farsighted Dependencies for Existential Rules
复制标题
走向存在规则的有远见的依赖
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Thomazo
中科院分区：
文献类型：
--
作者：
Jean;M. Mugnier;M. Thomazo
我们考虑存在规则(也称为元组生成依赖关系或Datalog+/-规则)。这些规则特别适合于及时的本体查询回答问题，该问题包括在考虑术语知识的同时查询数据。由于这个问题在一般情况下是不可判定的，文献中提出了确保可判定的各种条件。在本文中，我们重点讨论限制规则交互方式的条件，以确保前向链机制是有限的。在审查了现有的提议之后，我们提出了规则依赖的概念的推广，即k-依赖，它允许扩大暂停案例。它还可以用来编译规则库，从而改进查询回答算法。
We consider existential rules (also called Tuple-Generating Dependencies or Datalog+/- rules). These rules are particularly well-suited to the timely ontological query answering problem, which consists of querying data while taking terminological knowledge into account. Since this problem is not decidable in general, various conditions ensuring decidability have been proposed in the literature. In this paper, we focus on conditions that restrict the way rules may interact to ensure that the forward chaining mechanism is finite. After a review of existing proposals, we propose a generalization of the notion of rule dependency, namely k-dependency, that allows to enlarge halting cases. It can also be used to compile the rule base, which leads to improve query answering algorithms.