Combining OWL ontologies using ε-Connections

被引:44
作者
Grau, Bernardo Cuenca
Parsia, Bijan
Sirin, Evren
机构
[1] Univ Maryland, MIND Lab, Baltimore, MD 21201 USA
[2] Univ Valencia, Dept Informat, E-46100 Valencia, Spain
来源
JOURNAL OF WEB SEMANTICS | 2006年 / 4卷 / 01期
关键词
Web Ontology Language; integration and combination of ontologies; combination of knowledge representation formalisms; description logics reasoning;
D O I
10.1016/j.websem.2005.09.010
中图分类号
TP18 [人工智能理论];
学科分类号
081104 [模式识别与智能系统]; 0812 [计算机科学与技术]; 0835 [软件工程]; 1405 [智能科学与技术];
摘要
The standardization of the Web Ontology Language ( OWL) leaves ( at least) two crucial issues for Web-based ontologies unsatisfactorily resolved, namely how to represent and reason with multiple distinct, but linked ontologies, and how to enable effective knowledge reuse and sharing on the Semantic Web. In this paper, we present a solution for these fundamental problems based on E- Connections. We aim to use E- Connections to provide modelers with suitable means for developing Web ontologies in a modular way and to provide an alternative to the owl: imports construct. With such motivation, we present in this paper a syntactic and semantic extension of the Web Ontology language that covers E- Connections of OWL-DL ontologies. We show how to use such an extension as an alternative to the owl: imports construct in many modeling situations. We investigate different combinations of the logics SHIN( D), SHON( D) and SHIO( D) for which it is possible to design and implement reasoning algorithms, well- suited for optimization. Finally, we provide support for E-Connections in both an ontology editor, SWOOP, and an OWL reasoner, Pellet. (c) 2005 Elsevier B. V. All rights reserved.
引用
收藏
页码:40 / 59
页数:20
相关论文
共 33 条
[1]
[Anonymous], 2000, Logic Journal of the IGPL, DOI DOI 10.1093/JIGPAL/8.3.239
[2]
[Anonymous], P 19 INT JOINT C ART
[3]
Baader F, 2003, DESCRIPTION LOGIC HANDBOOK: THEORY, IMPLEMENTATION AND APPLICATIONS, P43
[4]
Baader F, 2002, J ARTIF INTELL RES, V16, P1
[5]
An Overview of Tableau Algorithms for Description Logics [J].
Baader F. ;
Sattler U. .
Studia Logica, 2001, 69 (1) :5-40
[6]
BAADER F, 2003, LECT NOTES ARTFICIAL
[7]
BAADER F, 2003, FUNDAMENTA INFORM, V57, P1
[8]
Bechhofer S, 2003, P 2 INT SEM WEB C IS
[9]
Borgida A, 2003, LECT NOTES COMPUT SC, V2800, P153
[10]
BOUQUET P, 2003, P 2 INT SEM WEB C IS