Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
489140 | Procedia Computer Science | 2011 | 7 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)