基于HS-树的所有MIPS求解算法

Computing All MIPS Based on HS-Tree

本体在语义web中扮演很重要的角色.本体的重用、合并或者进一步扩展都有可能导致本体不一致.目前很多解决本体不一致的方法都需要计算最小不一致保持子集(MIPS).本文利用HS-树方法给出了一种能够有效计算本体中所有MIPS的算法.实验表明该算法是有效的,尤其对于本体中包含不可满足的概念远远多于MIPS的情形更加有效.

Ontologies play an important role in Semantic Web. The reuse, merging or further extension of ontologies may result in inconsistency in ontologies. Currently most existing approaches for resolving inconsistency need to calculate Minimal-Incoherence-Preserving Sub-Tbox （MIPS） of an incoherent ontology. In this paper, an algorithm based on HS-Tree method is proposed for computing all the MIPS in ontologies. Experimental results demonstrate that the proposed algorithm is effective, especially for such cases that ontologies contain much more unsatisfiable concepts than MIPS.