Diagnosing Terminologies

Abstract

We present a framework for the debugging of logically con-tradicting terminologies, which is based on traditional model-based diagnosis. To study the feasibility of this highly gen-eral approach we prototypically implemented the hitting set algorithm presented in (Reiter 1987), and applied it in three different scenarios. First, we use a Description Logic reason-ing system as a black-box to determine (necessarily maximal) conict sets. Then we use our own non-optimized DL reason-ing engine to produce small, and a specialized algorithm to determine minimal conict sets. In a number of experiments we show that the rst method already fails for relatively small terminologies. However, based on small, or minimal conict sets, we can often calculate diagnoses in reasonable time.