A revision-based approach to handling inconsistency in description logics
A revision-based approach to handling inconsistency in description logics
复制标题
DOI：
10.1007/s10462-007-9044-3
复制
发表时间：
2006-10
影响因子：
12
通讯作者：
G. Qi;Weiru Liu;D. Bell
中科院分区：
文献类型：
--
作者：
G. Qi;Weiru Liu;D. Bell
近年来，描述逻辑中的不一致性处理问题引起了广泛的关注。基于现有的不一致性管理技术，已经提出了许多方法来处理这个问题。本文首先定义了描述逻辑中的两个修正算子，一个是基于弱化的修正算子，另一个是基于弱化的修正算子的加细。在此基础上，我们提出了一个处理简化描述逻辑知识库中不一致性的算法。我们表明，当削弱为基础的修正算子被选中，我们的算法所得到的知识库是语义等价的知识库通过applyrefined合取最大调整（RCMA），其中细化析取最大调整（DMA），已知是一个很好的策略，在经典逻辑中的不一致处理。
Recently, the problem of inconsistency handling in description logics has attracted a lot of attention. Many approaches have been proposed to deal with this problem based on existing techniques for inconsistency management. In this paper, we first define two revision operators in description logics; one is called a weakening-based revision operator and the other is its refinement. Based on the revision operators, we then propose an algorithm to handle inconsistency in astratifieddescription logic knowledge base. We show that when the weakening-based revision operator is chosen, the resulting knowledge base of our algorithm is semantically equivalent to the knowledge base obtained by applyingrefined conjunctive maxi-adjustment(RCMA) which refines disjunctive maxi-adjusment (DMA), known to be a good strategy for inconsistency handling in classical logic.