WordNet: a lexical database for English
Communications of the ACM
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Generic Schema Matching with Cupid
Proceedings of the 27th International Conference on Very Large Data Bases
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
A survey of approaches to automatic schema matching
The VLDB Journal — The International Journal on Very Large Data Bases
Rondo: a programming platform for generic model management
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
The Knowledge Engineering Review
AMUSE: a minimally-unsatisfiable subformula extractor
Proceedings of the 41st annual Design Automation Conference
iMAP: discovering complex semantic matches between database schemas
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Verification of Proofs of Unsatisfiability for CNF Formulas
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
COMA: a system for flexible combination of schema matching approaches
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Explaining subsumption in description logics
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Argumentation over ontology correspondences in MAS
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Towards Semantic Mapping for Casual Web Users
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
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
A Resource List Management Tool for Undergraduate Students Based on Linked Open Data Principles
ESWC 2009 Heraklion Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications
Save up to 99% of your time in mapping validation
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems: Part II
Visualizing Semantic Web proofs of defeasible logic in the DR-DEVICE system
Knowledge-Based Systems
On identifying knowledge processing requirements
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Reaching agreement over ontology alignments
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Datalog for security, privacy and trust
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Hi-index | 0.00 |
Managing semantic heterogeneity is a complex task. One solution involves matching like terms to each other. We view Match as an operator that takes two graph-like structures (e.g., concept hierarchies or ontologies) and returns a mapping between the nodes of the graphs that correspond semantically to each other. While some state of the art matching systems may produce effective mappings, these mappings may not be intuitively obvious to human users. In order for users to trust the mappings, and thus, use them, they need information about them (e.g., they need access to the sources that were used to determine semantic correspondences between terms). In this paper we describe how a matching system can explain its answers using the Inference Web (IW) infrastructure thus making the matching process transparent. The proposed solution is based on the assumption that mappings are computed by logical reasoning. There, S-Match, a semantic matching system, produces proofs and explanations for mappings it has discovered.