Efficient Semantic Matching

Giunchiglia, Fausto and Yatskevich, Mikalai and Giunchiglia, Enrico (2004) Efficient Semantic Matching. UNSPECIFIED. (In Press)

Download (188Kb) | Preview


    We think of Match as an operator which takes two graph-like structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class of problems. According to the tests we have done so far, the optimizations substantially improve the time performance of the system.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA076 Computer software > QA076.7 Programming Languages - Semantics
    Additional Information: The paper is accepted to 2nd European Semantic Web Conference (ESWC'05)
    Report Number: DIT-04-112
    Repository staff approval on: 25 Mar 2005

    Actions (login required)

    View Item