Hostname: page-component-cd9895bd7-hc48f Total loading time: 0 Render date: 2024-12-25T19:26:25.283Z Has data issue: false hasContentIssue false
  • English
  • Français

Semantic matching

Published online by Cambridge University Press:  13 May 2004

FAUSTO GIUNCHIGLIA  and
PAVEL SHVAIKO
FAUSTO GIUNCHIGLIA
Affiliation:
DIT – Dept. of Information and Communication Technology, University of Trento, 38050 Povo, Trento, Italy; e-mail: [email protected], [email protected]
PAVEL SHVAIKO
Affiliation:
DIT – Dept. of Information and Communication Technology, University of Trento, 38050 Povo, Trento, Italy; e-mail: [email protected], [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

We think of match as an operator that takes two graph-like structures (e.g. database schemas or ontologies) and produces a mapping between elements of the two graphs that correspond semantically to each other. The goal of this paper is to propose a new approach to matching, called semantic matching. As its name indicates, in semantic matching the key intuition is to exploit the model-theoretic information, which is codified in the nodes and the structure of graphs. The contributions of this paper are (i) a rational reconstruction of the major matching problems and their articulation in terms of the more generic problem of matching graphs, (ii) the identification of semantic matching as a new approach for performing generic matching and (iii) a proposal for implementing semantic matching by testing propositional satisfiability.

Type
Research Article
Information
The Knowledge Engineering Review , Volume 18 , Issue 3 , September 2003 , pp. 265 - 280
Copyright
© 2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)