Incremental Reasoning in OWL EL without Bookkeeping
Incremental Reasoning in OWL EL without Bookkeeping
复制标题
DOI：
10.1007/978-3-642-41335-3_15
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
Yevgeny Kazakov;P. Klinov
中科院分区：
文献类型：
--
作者：
Yevgeny Kazakov;P. Klinov
我们描述了一种方法来更新的分类表示在家庭的描述逻辑后，一些公理已被添加或删除的本体。虽然增量分类模加法相对简单，但处理删除更有问题，因为它需要收回不再有效的逻辑结果。已知的算法使用各种形式的簿记来解决这个问题，以将结果追溯到前提。但是这样的附加数据会消耗内存，并在应用推理过程中给推理器带来额外的负担。在本文中，我们提出了一种技术，它避免了这种额外的成本，同时是非常有效的本体的小增量变化。该技术作为开源推理机ELK的一部分免费提供，其效率在自然发生和合成数据上得到了证明。
We describe a method for updating the classification of ontologies expressed in thefamily of Description Logics after some axioms have been added or deleted. While incremental classification modulo additions is relatively straightforward, handling deletions is more problematic since it requires retracting logical consequences that are no longer valid. Known algorithms address this problem using various forms of bookkeeping to trace the consequences back to premises. But such additional data can consume memory and place an extra burden on the reasoner during application of inferences. In this paper, we present a technique, which avoids this extra cost while being very efficient for small incremental changes in ontologies. The technique is freely available as a part of the open-sourcereasoner ELK and its efficiency is demonstrated on naturally occurring and synthetic data.