Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters
Ontology mapping: the state of the art
The Knowledge Engineering Review
Algorithm Design
Semantic-integration research in the database community
AI Magazine - Special issue on semantic integration
ACM SIGMOD Record
Ontology Matching
Feedback arc set in bipartite tournaments is NP-complete
Information Processing Letters
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
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A cognitive support framework for ontology mapping
ISWC'07/ASWC'07 Proceedings of the 6th international The semantic web and 2nd Asian conference on Asian semantic web conference
Learning in Presence of Ontology Mapping Errors
WI-IAT '10 Proceedings of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Repairing unsatisfiable concepts in OWL ontologies
ESWC'06 Proceedings of the 3rd European conference on The Semantic Web: research and applications
A survey of the web ontology landscape
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
A polynomial kernel for feedback arc set on bipartite tournaments
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A quadratic vertex kernel for feedback arc set in bipartite tournaments
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
Theory of Computing Systems
| Hi-index | 0.00 |
Many applications require the establishment of mappings between ontologies. Such mappings are established by domain experts or automated tools. Errors in mappings can introduce inconsistencies in the resulting combined ontology. We consider the problem of identifying the largest consistent subset of mappings in hierarchical ontologies. We consider mappings that assert that a concept in one ontology is a subconcept, superconcept, or equivalent concept of a concept in another ontology and show that even in this simple setting, the task of identifying the largest consistent subset is NP-hard. We explore several polynomial time algorithms for finding suboptimal solutions including a heuristic algorithm to this problem. We experimentally compare the algorithms using several synthetic as well as real-world ontologies and mappings.