基于可拓理论的描述逻辑扩展  

Description Logic extension based on extenics theory

作　　者：王静[1] 贾成伟[2] 张健沛[1] 杨静[1] 

机构地区：[1]哈尔滨工程大学计算机科学与技术学院,哈尔滨150001 [2]哈尔滨师范大学计算机与信息技术系,哈尔滨150301

出　　处：《计算机应用》2008年第8期2071-2073,2076,共4页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60673131)

摘　　要：传统描述逻辑不适合于处理信息不全、存在隐性知识甚至存在矛盾前提的问题,所以作为语义Web的逻辑基础它是不充分的,为此引入可拓学中的物元及其发散规则对它进行了扩充。首先给出了物元的语义解释,然后引入物元及其发散规则扩充Tableau算法,生成了Tableau-E算法和Tableau-E′算法,从而实现了对实例断言集Abox的扩展以及一致性检测,弥补了传统描述逻辑的不足。Traditional Description Logic （DL） does not fit to handle the problems with incomplete information, tracit knowledge or even contradiction premise. Therefore it is not sufficient to be the logical foundation of the Semantic Web. For this reason, the matter-element and divergence rules of Extenics were introduced to extend the traditional DL. Firstly, the semantic explanation of matter-element was given. Then the matter-element and divergence rules were used to extend the Tableau algorithm to be new Tableau-E algorithm and Tableau-E＇algorithm, thus realizing the extension and consistency checking of Abox （ assertion of individuals）, and making up the deficiency of traditional DL.

关 键 词：语义WEB 描述逻辑 可拓学 物元 发散规则 

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