首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于判别规则的最小不一致知识子集识别
引用本文:王文斌,杨帆,饶一梅,陈秋双.基于判别规则的最小不一致知识子集识别[J].东南大学学报,2008,24(3).
作者姓名:王文斌  杨帆  饶一梅  陈秋双
作者单位:南开大学信息技术科学学院,天津300071
摘    要:为解释本体中概念不满足的原因,利用2个对等转换(即公理细化和本体约减)与3个判别规则识别不满足概念C的最小不一致知识子集(MUPS).其中,判别规则基于不满足概念的传递性,将MUPS分为3类:完全依赖于C(MUPSf)、传递依赖于C(MUPSt)和不确定依赖于C(MUPSu).实验结果表明:在本体不满足概念的MUPS中,MUPSt往往占大多数,但只有MUPSf可以明确指出概念不满足的根本原因.本体建模人员和领域专家可以采用迭代修复方式,每一次修复只考虑MUPSf,以提高修复效率.所得分类结果对于从修复角度评价本体质量以及指导修复工作都具有重要意义.

关 键 词:本体调试  最小不一致知识子集  判别规则

MUPS identification based on discrimination rules
Wang Wenbin,Yang Fan,Rao Yimei,Chen Qiushuang.MUPS identification based on discrimination rules[J].Journal of Southeast University(English Edition),2008,24(3).
Authors:Wang Wenbin  Yang Fan  Rao Yimei  Chen Qiushuang
Abstract:The minimal unsatisfiability-preserving sub-TBoxes(MUPS)of an unsatisfiable class C identified by two equivalent transformations,axiom splitting and ontology reduction,and three discrimination rules comprise minimal sets of axioms which support the unsatisfiability.Discrimination rules classify all MUPS into three types based on the transitivity of unsatisfiability,fully dependent on C(MUPSf),transitively dependent on C(MUPSt)and uncertainly dependent on C(MUPSu).The results show that the number of MUPSt is frequently a large fraction of the total number of all MUPS,but only MUPSf catches the root error of C.Modelers and domain experts conduct iterative repair work effectively,considering only MUPSf in each iteration.The classification shows the significance for the evaluation of the quality of ontologies from the perspective of maintenance and for repair work.
Keywords:ontology debugging  minimal unsatisfiability-preserving sub-TBoxes (MUPS)  discrimination rules
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号