A graph-based approach for resolving incoherent ontology mappings
What is it about?
We develop a graph-based approach for mapping validation, which is complete for detecting the incoherence of mappings among DL-Lite ontologies. The approach consists of a set of graph construction rules, a graph-based incoherence detection algorithm, and a graph-based incoherence repair algorithm.
Why is it important?
The state-of-the-art repair methods often suffer from two limitations. First, most methods rely on the weights of mappings as a measure of correctness of the mappings in conflict sets. Such weights are assigned or computed by individual ontology matchers, thus they can be unreliable and have negative impacts on the quality of mapping repairing. Moreover, when mappings are removed to regain coherence, the knowledge implied in these mappings are discarded at the same time, which could be potentially exploited for indicating entailments across ontologies