基于保守扩充理论的模块化本体重用  

Modular Ontology Reuse Based on Conservative Extension Theory

作　　者：李璞[1,2] 蒋运承[1] 王驹[3] LI Pu JIANG Yun-Cheng WANG Ju(School of Computer Science, South China Normal University, Guangzhou 510631, China Software Engineering College, Zhengzhou University of Light Industry, Zhengzhou 450000, China College of Computer Science and Information Engineering, Guangxi Normal University, Guilin 541004, China)

机构地区：[1]华南师范大学计算机学院,广东广州510631 [2]郑州轻工业学院软件学院,河南郑州450000 [3]广西师范大学计算机科学与信息工程学院,广西桂林541004

出　　处：《软件学报》2016年第11期2777-2795,共19页Journal of Software

基　　金：国家自然科学基金(61272066);教育部新世纪优秀人才支持计划(NCET-12-0644);广州市科技计划(2014J4100031;201604010098);广西可信软件重点实验室(桂林电子科技大学)研究课题(KX201419)~~

摘　　要：分析了本体重用的研究现状和目前重用方法只适用于单个独立本体的不足,以ε-Connections语言构建的模块化本体库为研究对象,基于保守扩充理论提出了本体模块知识完整性概念,并证明了知识完整性的相关性质.在此基础上,给出了一种针对模块化本体库的保守扩充重用算法ERMMO(extracting reused modules from modular ontologies),讨论了该算法的两种子算法EMMO_(IK)和EMO_(IK)的特点及适用条件.分析并验证了ERMMO算法的可行性和正确性.ERMMO算法是当前保守扩充重用算法的一般化扩充,对模块化思想应用于本体重用问题有所启示.In this paper, the current research progresses of ontology reuse is reviewed and the issue that current ontology reuse algorithms can merely be applied to a single independent ontology is addressed. Focusing on the modular ontologies with s-Connections language, the IKMo （integrity of knowledge about the module in an ontology） is presented based on the theory of conservative extension. The related properties of IKMo are proved. Further, an algorithm for the ontology reuse with the conservative extension ERMMO （extracting reused modules from modular ontologies） is provided. The features and conditions of two sub-algorithms of ERMMO are discussed. Lastly, the feasibility and soundness of ERMMO are analyzed and verified. ERMMO is a generalization of the current reuse algorithms based on conservative extension theory, and can be served as the guidelines for reuse of modular ontologies.

关 键 词：本体重用 保守扩充 模块化 ε-Connections理论 

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