###
Journal of Software:2015.26(9):2231-2249

基于概念R-MUPS的本体调试方法
欧阳丹彤,苏静,叶育鑫,崔仙姬
(吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012;吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012;国家地球物理探测仪器工程技术研究中心(吉林大学), 吉林 长春 130026;吉林大学 计算机科学与技术学院, 吉林 长春 130012;符号计算与知识工程教育部重点实验室(吉林大学), 吉林 长春 130012;大连民族大学 信息与通信工程学院, 辽宁 大连 116600)
The Ontology Debugging Method Based on Concept R-MUPS
OUYANG Dan-Tong,SU Jing,YE Yu-Xin,CUI Xian-Ji
(College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education (Jilin University), Changchun 130012, China;College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education (Jilin University), Changchun 130012, China;National Engineering Research Center of Geophysics Exploration Instruments(Jilin University), Changchun 130026, China;College of Computer Science and Technology, Jilin University, Changchun 130012, China;Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education (Jilin University), Changchun 130012, China;College of Information and Communication Engineering, Dalian Nationalities University, Dalian 116600, China)
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 1576   Download 1642
Received:June 29, 2013    Revised:April 09, 2014
> 中文摘要: 通过定义不可满足概念间的覆盖关系,发现MUPS和MIPS之间的内在关联,从而引出不可满足概念的R-MUPS;给出并证明不一致本体术语集中至少存在一个不可满足概念的R-MUPS就是该术语集的MIPS;利用这一结论,提出基于有序标签演算的R-MUPS算法,采用深度优先遍历原则合并分支计算R-MUPS,同时缓存覆盖概念集合,加快MIPS的求解,实现本体调试.通过概念扩展树与概念R-MUPS算法的等价性,证明算法的正确性并分析其复杂度.最后,利用自动生成本体、现实本体及其扩建本体的数据进行全面测试.实验结果表明:基于R-MUPS的MIPS求解方法能够高效、准确地完成本体调试任务.
中文关键词: 本体调试  描述逻辑  定位  MUPS  MIPS
Abstract:In this paper, an inherent relationship between MUPS and MIPS is obtained by defining covering relations of unsatisfiable concepts and developing the definition of R-MUPS of unsatisfiable concept. Then a proof is given that there exists at least one unsatisfiable concept whose R-MUPS is also a MIPS for every MIPS. Based on this conclusion, an R-MUPS algorithm based on the ordered label calculus is proposed. It applies depth-first traversal in merging branches to calculate R-MUPS, and also caches the concepts of covered at the same time to speed up the solving of MIPS to achieve ontology debugging. Through revealing the equivalence between concept expansion tree and R-MUPS algorithm, the correctness of R-MUPS algorithm is proved, and its complexity is further analyzed. Finally, a comprehensive test is performed using automatically generated ontology test sets, realistic ontology and its expansion ontology. The experimental results show that the solving of MIPS based on R-MUPS algorithm can efficiently and accurately complete the ontology debugging tasks.
文章编号:     中图分类号:    文献标志码:
基金项目:国家自然科学基金(61272208, 61133011, 41172294, 61170092); 吉林省科技发展计划(201201011) 国家自然科学基金(61272208, 61133011, 41172294, 61170092); 吉林省科技发展计划(201201011)
Foundation items:
Reference text:

欧阳丹彤,苏静,叶育鑫,崔仙姬.基于概念R-MUPS的本体调试方法.软件学报,2015,26(9):2231-2249

OUYANG Dan-Tong,SU Jing,YE Yu-Xin,CUI Xian-Ji.The Ontology Debugging Method Based on Concept R-MUPS.Journal of Software,2015,26(9):2231-2249