Computing All MIPS Based on HS-Tree
Qiu Ji · Journal of Beijing Jiaotong University · 2009
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.