期刊文献+

基于保守扩充理论的模块化本体重用 被引量:2

Modular Ontology Reuse Based on Conservative Extension Theory
下载PDF
导出
摘要 分析了本体重用的研究现状和目前重用方法只适用于单个独立本体的不足,以ε-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.
作者 李璞 蒋运承 王驹 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)
出处 《软件学报》 EI CSCD 北大核心 2016年第11期2777-2795,共19页 Journal of Software
基金 国家自然科学基金(61272066) 教育部新世纪优秀人才支持计划(NCET-12-0644) 广州市科技计划(2014J4100031 201604010098) 广西可信软件重点实验室(桂林电子科技大学)研究课题(KX201419)~~
关键词 本体重用 保守扩充 模块化 ε-Connections理论 ontology reuse conservative extension modularization s-Connections theory
  • 相关文献

参考文献2

二级参考文献21

  • 1史忠植,蒋运承,张海俊,董明楷.基于描述逻辑的主体服务匹配[J].计算机学报,2004,27(5):625-635. 被引量:62
  • 2史忠植,董明楷,蒋运承,张海俊.语义Web的逻辑基础[J].中国科学(E辑),2004,34(10):1123-1138. 被引量:71
  • 3Cuenca G B, Parsia B, Sirin El et al. Modularizing OWL Ontologies[C]//Proc. of KCAP'05. Banff, Canada: [s. n.], 2005.
  • 4Kutz O, Lutz C, Woher F, et al. e-Connections of Abstract Description Systems[J]. Artificial Intelligence, 2004, 156(1): 1-73.
  • 5Baader F, Calvanese D, McGuinness D L, et al. The Description Logic Handbook[M]. Britain, UK: Cambridge University Press, 2003.
  • 6Cuenea G B, Parsia B, Sirin E. Combining OWL Ontologies Using ε-Connections[J]. Journal of Web Semantics, 2005, 4(1): 1-42.
  • 7Cuenea G B, Parsia B, Sirin E. Tableau Algorithms for ε-Connections of Description Logics[R]. University of Maryland Institute for Advanced Computer Studies, Tech. Rep.: 2004-72, 2004.
  • 8A Artale, E Franconi. A temporal description logic for reasoning about actions and plans [J]. Journal of Artificial Intelligence Research, 1998, 9(2):463-506
  • 9I Horrocks. DAML + OIL: A description logic for the semantic Web [J]. Bulletin of the IEEE Computer Society Technical Committee on Data Engineering, 2002, 25(1): 4-9
  • 10I Horrocks, P F Patel-Schneider. Reducing OWL entailment to description logic satisfiability [J]. Journal of Web Semantics:Science, Services and Agents on the World Wide Web, 2004, 1(4) : 345-357

共引文献15

同被引文献13

引证文献2

二级引证文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部