z-logo
open-access-imgOpen Access
A description logics formalization for the ontology matching
Author(s) -
Manel Kolli,
Zizette Boufaïda
Publication year - 2011
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2010.12.006
Subject(s) - computer science , ontology , matching (statistics) , ontology alignment , description logic , theoretical computer science , information retrieval , programming language , upper ontology , semantic web , epistemology , philosophy , statistics , mathematics
In this paper, we propose a new solution to the ontology matching problem. The deduction of the relations among the semantic entities is done by aggregating or composing the relations between their subsumers, which are already deduced by using the semantic distance. The results are validated with the description logics (DLs) mechanisms. Furthermore, our approach is presented in a formal way by exploiting the mechanisms of DLs reasoning. This allows us to have complete and precise results. During the process, we use an example to well explain how the proposed approach works

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom