The problem of finding an agreement on the meaning of heterogeneous schemas is one of the key issues in the development of the Semantic Web. In this paper, we propose a new algorithm for discovering semantic mappings across hierarchical classifications based on a new approach to semantic coordination. This approach shifts the problem of semantic coordination from the problem of computing linguistic or structural similarities (what most other proposed approaches do) to the problem of deducing relations between sets of logical formulas that represent the meaning of nodes belonging to different schemas. We show how to apply the approach and the algorithm to an interesting family of schemas, namely hierarchical classifications. Finally, we argue why this is a significant improvement on previous approaches. © Springer-Verlag Berlin Heidelberg 2004.
Coordinating Semantic Peers
Bouquet, Paolo;Serafini, Luciano;Zanobini, Stefano
2004-01-01
Abstract
The problem of finding an agreement on the meaning of heterogeneous schemas is one of the key issues in the development of the Semantic Web. In this paper, we propose a new algorithm for discovering semantic mappings across hierarchical classifications based on a new approach to semantic coordination. This approach shifts the problem of semantic coordination from the problem of computing linguistic or structural similarities (what most other proposed approaches do) to the problem of deducing relations between sets of logical formulas that represent the meaning of nodes belonging to different schemas. We show how to apply the approach and the algorithm to an interesting family of schemas, namely hierarchical classifications. Finally, we argue why this is a significant improvement on previous approaches. © Springer-Verlag Berlin Heidelberg 2004.| File | Dimensione | Formato | |
|---|---|---|---|
|
AMKM-04.pdf
accesso aperto
Tipologia:
Pre-print non referato (Non-refereed preprint)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
138.82 kB
Formato
Adobe PDF
|
138.82 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione



