As a tractable description logic, DL-Lite provides a good compromise between expressive power and computational complexity of inference. It is therefore important to study ways of handling inconsistencies in tractable DL-Lite based ontologies, as classical description logics break down in the presence of inconsistent knowledge bases. In this paper, we present an argumentation-based approach to dealing with inconsistent DL-Lite based ontologies. Furthermore, we mainly develop a graph-based algorithm to implement paraconsistent reasoning in DL-Lite.
展开▼
