Paraconsistent Description Logics Revisited

Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-tolerant) description logics have been studied by several researchers to cope with such inconsistencies. In this paper, a new paraconsistent description logic, PALC, is obtained from the description logic ALC by adding a paraconsistent negation. Some theorems for embedding PALC into ACL are proved, and PALC is shown to be decidable. A tableau calculus for PALC is introduced, and the completeness theorem for this calculus is proved.