A revision-based approach to handling inconsistency in description logics

Recently, the problem of inconsistency handling in de-scription logics has attracted a lot of attention. Many ap-proaches were proposed to deal with this problem based on existing techniques for inconsistency management. In this paper, we first define two revision operators in description logics, one is called the weakening-based revision operator and the other is its refinement. The logical properties of the operators are analyzed. Based on the revision operators, we then propose an algorithm to handle inconsistency in a stratified description logic knowledge base. We show that when the weakening-based revision operator is chosen, the resulting knowl-edge base of our algorithm is semantically equivalent to the knowledge base obtained by applying refined con-junctive maxi-adjustment (RCMA) which refines the disjunctive maxi-adjusment (DMA), a good strategy for inconsistency handling in classical logic