一种基于符号变换的描述逻辑ALC超协调推理算法  

Algorithm Based on Sign Transformation for Paraconsistent Reasoning in Description Logic ALC

作　　者：张小旺[1,2] 肖国辉[3] 

机构地区：[1]北京大学信息科学系,北京100871 [2]安徽大学数学科学学院,合肥230039 [3]维也纳技术大学信息系统研究所

出　　处：《计算机科学》2011年第3期206-212,共7页Computer Science

基　　金：国家自然科学基金(60973003)资助

摘　　要：语义万维网作为一个开放、不断更新而且相互协作的环境,经常会包含一些不协调的或不精确的信息。众所周知,描述逻辑是语义万维网重要的逻辑基础,然而描述逻辑缺乏处理不协调或不完全信息的能力。近来一些超协调方案通过限制或阻止使用一些推理规则来避免推理的平凡化,从而容忍本体中出现的不协调。因为这些方法限制了描述逻辑系统的推理能力,所以推理能力弱于经典的描述逻辑推理能力,即使在处理协调的本体时。提出一种基于符号变换的具有强推理能力的超协调推理算法。证明了该算法是可判定的,而且在处理协调的本体时该推理系统与经典逻辑系统具有相等的推理能力。In an open,constantly changing and collaborative environment like the forthcoming Semantic Web,it is reasonable to expect that knowledge sources will contain noise and inaccuracies.It is well known,as the logical foundation of the Semantic Web,description logic is lack of the ability of tolerating inconsistent or incomplete data.Recently,some paraconsistent scenarios were used to avoid trivial inferences so that inconsistencies occurring in ontologies could be tole-rated.Their inference powers are always weaker than that of classical description logics even handling consistent ontologoies since they cost the inference power of description logics.This paper proposed a tableau algorithm based on sign transformation which has stronger reasoning ability.We proved that the new paraconsistent tableau algorithm is decidable and has the same reasoning ability with the classical Description Logic over consistent ontologies.

关 键 词：语义互联网 描述逻辑ALC 表演算 超协调表演算 不协调性处理 

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