Abstract: A schema match approach based on semantics is put forward.Firstly,the concepts at labels is built,and the semantic relationship between labels is computed,then the concepts at labels to concept at a node by a conjunction of all concepts at labels located above the given node are extended,including the node itself,concepts at node are translated into propositional formulas and then into CNF,which allows us to translate the matching problem into a propositional validity problem,which can then be efficiently resolved using SAT.Different versions of WCS schema-matching experiments show that the average recall of the semantic matching for the schemas is above 82%,the average precision reaches 91%,and the average overall achieves 67%.