Semantic Matching

Giunchiglia, Fausto and Shvaiko, Pavel (2003) Semantic Matching. UNSPECIFIED.

[img]
Preview
 PDF
Download (657Kb) | Preview

    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 of implementing semantic matching by testing propositional satisfiability.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Additional Information: In The Knowledge Engineering Review journal, 18(3):265-280, 2004.
    Report Number: DIT-03-013
    Repository staff approval on: 02 Jul 2004

    Actions (login required)

    		 View Item