Mediation of foundation ontology based knowledge sources

被引:6
作者
Anjum, Najam A. [1 ]
Harding, J. A. [1 ]
Young, R. I. [1 ]
Case, K. [1 ]
机构
[1] Univ Loughborough, Wolfson Sch Mech & Mfg Engn, Loughborough LE11 3TU, Leics, England
关键词
Interoperability; Knowledge verification; Foundation ontologies; Domain ontologies; Common Logic;
D O I
10.1016/j.compind.2012.01.009
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Ontologies are helpful in giving interoperable structures to sources of knowledge and information. This interoperability, however, is greatly hindered by the heterogeneity of independently developed ontologies which in turn increases the requirements for mediation systems to reconcile the differences. A core concepts ontology for a certain domain contained by a foundation ontology can be used to alleviate this problem and to facilitate the reconciliation efforts. Possible differences in the use of concepts from the core concepts to model entities in domain ontologies can be prevented by binding the domain ontology developers to some rules. These rules can be particularly useful for domain ontologies requiring some kind of traceability of their concepts in the foundation ontology. The mediation system can then use this traceability to establish similarities between two ontologies. Software applications, like the one explained in this paper, can then be developed to perform the mediation task automatically and accurately. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:433 / 442
页数:10
相关论文
共 29 条
[1]  
Aleksovski Z., 2006, P INT C KNOWL ENG KN
[2]  
ALEKSOVSKI Z, 2006, P INT WORKSH ONT MAT
[3]   Gap Analysis of Ontology Mapping Tools and Techniques [J].
Anjum, Najam ;
Harding, Jenny ;
Young, Bob ;
Case, Keith .
ENTERPRISE INTEROPERABILITY IV: MAKING THE INTERNET OF THE FUTURE FOR THE FUTURE OF ENTERPRISE, 2010, :303-312
[4]  
[Anonymous], 2010, KFL REF
[5]  
[Anonymous], 24707 ISOIEC
[6]  
Chungoora N., 2010, THESIS LOUGHBOROUGH
[7]  
Deng J., 2009, CVPR09 2009
[8]  
Doan A-H., 2002, PROC WWW, P662, DOI [10.1145/511446.511532, DOI 10.1145/511446.511532]
[9]  
Ehrig M, 2004, LECT NOTES COMPUT SC, V3298, P683
[10]  
Gangemi A, 2002, LECT NOTES ARTIF INT, V2473, P166