Project description >> SMatch component
SMatch is a schema-based matching system. It takes two graph-like structures (e.g., classifications) and returns semantic relations (e.g., equivalence, subsumption) between the nodes of the graphs that correspond semantically to each other. The relations are determined by analyzing the meaning (concepts, not labels) which is codified in the elements and the structures of schemas/ontologies. In particular, labels at nodes, written in natural language, are translated into propositional formulas which explicitly codify the label's intended meaning. This allows for a translation of the matching problem into a propositional unsatisfiability problem, which can then be efficiently resolved using (sound and complete) state of the art propositional satisfiability deciders. S-Match was designed and developed as a platform for semantic matching, namely a highly modular system with the core of computing semantic relations where single components can be plugged, unplugged or suitably customized.
The following paper provides comprehensive details of the semantic matching algorithm which is implemented in the SMatch system:
F. Giunchiglia, P. Shvaiko: Semantic Matching (In The Knowledge Engineering Review Journal, 18(3):265-280, 2003. Short versions inProceedings of ODS workshop at IJCAI'03 and SI workshop at ISWC'03).
Here we provide the results of some experiments with the SMatch system: experiments.