The problem of finding an agreement on the meaning of heterogeneous semantic models is one of the key issues in the development of the Semantic Web. In this paper, we propose (i) a general algorithm which implements a new approach, called CTXMATCH, for discovering (semantic) relationships across distinct and autonomous generic structures and (ii) a specific algorithm specializing the algorithm to the discovering of mappings across \emph{hierarchical classifications. This approach shifts the problem of semantic coordination from the problem of computing linguistic and/or structural similarities between semantic-based structures (what most other proposed approaches do), to the problem of deducing relations between sets of logical formulas that represent the meaning of concepts belonging to different structures
An Algorithm for Semantic Coordination
Bouquet, Paolo;Serafini, Luciano;
2003-01-01
Abstract
The problem of finding an agreement on the meaning of heterogeneous semantic models is one of the key issues in the development of the Semantic Web. In this paper, we propose (i) a general algorithm which implements a new approach, called CTXMATCH, for discovering (semantic) relationships across distinct and autonomous generic structures and (ii) a specific algorithm specializing the algorithm to the discovering of mappings across \emph{hierarchical classifications. This approach shifts the problem of semantic coordination from the problem of computing linguistic and/or structural similarities between semantic-based structures (what most other proposed approaches do), to the problem of deducing relations between sets of logical formulas that represent the meaning of concepts belonging to different structuresI documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
