Direct computation of diagnoses for ontology alignment
Kostyantyn Shchekotykhin, Philipp Fleiß, Patrick Rodler, GERHARD E. FRIEDRICH · 2012
Abstract. Modern ontology debugging methods allow efficient identification and localization of faulty axioms in an ontology. However, in many use cases such as ontology alignment the ontologies might include many conflict sets, i.e. sets of axioms preserving the faults, thus making ontology diagnosis infeasible. In this paper we present a debugging approach based on a direct computation of diagnoses that omits calculation of conflict sets. The evaluation results show that the approach is practicable and is able to identify a fault in adequate time. 1 Algorithm details and evaluation Most of the modern debugging approaches apply the model-based diagnosis [3] and compute diagnoses using conflict sets CS, i.e. irreducible sets of axioms ax i in an ontology O that preserve a fault. A user should modify at least all axioms of a diagnosis in order to be able to formulate the intended (target) ontology Ot. The computation of the conflict sets can be done within a polynomial number of calls to the reasoner, e.g. by QUICKXPLAIN algorithm [2]. To identify a diagnosis of cardinality |D | = m the hitting set algorithm suggested in [3] requires computation of m conflict sets. In the use