DMCA
Efficient semantic matching (2004)
Cached
Download Links
- [eprints.biblio.unitn.it]
- [eprints.biblio.unitn.it]
- [www.ee.surrey.ac.uk]
- [userver.ftw.at]
- DBLP
Other Repositories/Bibliography
| Citations: | 855 - 68 self |
BibTeX
@MISC{Giunchiglia04efficientsemantic,
author = {Fausto Giunchiglia and Mikalai Yatskevich and Enrico Giunchiglia},
title = {Efficient semantic matching},
year = {2004}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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.
