Semantic matching is a type ofontology matching technique that relies on semantic information encoded in lightweight ontologies to identify nodes that are semantically related in graph-like structures.
SPSM is a type ofsemantic matching producing a similarity score and a mapping preserving structural properties:(i) one-to-one correspondences between semantically related nodes;(ii) functions are matched to functions and variables to variables.
The set of minimal mappings is a subset of all possible semantic mappings such that:i) all the other correspondences can be computed from the ones in the minimal set, andii) none of the correspondences in the minimal set can be dropped without losing propertyi).
Lightweight ontologies provide the formal representation to be able to reason about hierarchical structures such as classifications. Each node's label in the classification is translated into propositional description logic (DL) formula, which univocally codifies the meaning of the node.
© 2010Knowdive @DISI