A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
Applying the Davis-Putnam Procedure to Non-clausal Formulas
AI*IA '99 Proceedings of the 6th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence
Rondo: a programming platform for generic model management
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
The Knowledge Engineering Review
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Matching large schemas: Approaches and evaluation
Information Systems
Electronic Commerce Research and Applications
Ten Challenges for Ontology Matching
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
Approximate Structure-Preserving Semantic Matching
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
A large dataset for the evaluation of ontology matching
The Knowledge Engineering Review
Discovering Missing Background Knowledge in Ontology Matching
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Faceted Lightweight Ontologies
Conceptual Modeling: Foundations and Applications
Encoding classifications into lightweight ontologies
Journal on data semantics VIII
Semantic matching: algorithms and implementation
Journal on data semantics IX
A large scale taxonomy mapping evaluation
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Object role modelling for ontology engineering in the DOGMA framework
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
An analysis of service trading architectures
EC-Web'06 Proceedings of the 7th international conference on E-Commerce and Web Technologies
Web explanations for semantic heterogeneity discovery
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
ASeMatch: a semantic matching method
TSD'06 Proceedings of the 9th international conference on Text, Speech and Dialogue
From folksologies to ontologies: how the twain meet
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Domains and context: First steps towards managing diversity in knowledge
Web Semantics: Science, Services and Agents on the World Wide Web
Hi-index | 0.00 |
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.