Reasoning with Inconsistent Ontologies  

作　　者：方俊 Zhisheng Huang 

机构地区：[1]School of Automation, Northwestern Polytechnical University, Xi'an 710072, China [2]Computer Science Department, Vrije Universiteit Amsterdam, Amsterdam, the Netherlands

出　　处：《Tsinghua Science and Technology》2010年第6期687-691,共5页清华大学学报（自然科学版（英文版）

基　　金：Supported by the Specialized Research Fund for the Doctoral Program of Higher Education of MOE, P.R.C (No.20096102120037)

摘　　要：Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.Reasoning with inconsistent ontologies involves using an inconsistency reasoner to get meaningful answers from inconsistent ontologies. This paper introduces an improved inconsistency reasoner, which selects consistent subsets using minimal inconsistent sets and a resolution method, to improve the run-time performance of the reasoning processing. A minimal inconsistent set contains a minimal explanation for the inconsistency of a given ontology. Thus, it can replace the consistency checking operation, which is executed frequently in existing approaches. When selecting subsets of the inconsistent ontology, formulas which can be directly or indirectly resolved with the negation of the query formula are selected because only those formulas affect the consequences of the reasoner. Therefore, the complexity of the reasoning processing is significantly reduced. Tests show that the run-time performance of the inconsistency reasoner is significantly improved.

关 键 词：minimal inconsistent set （MIS） inconsistency reasoner resolvable relevance inconsistent ontologies 

分 类 号：TP181[自动化与计算机技术—控制理论与控制工程]