S. P. Odintsov and H. Wansing, “Inconsistency-Tolerant Description Logic. Part II: Tableau Algorithms,” Journal of Applied Logic, Vol. 6, No. 3, 2008, pp. 343-360. doi:10.1016/j.jal.2007.06.001

has been cited by the following article:

• TITLE: A Comparison of Paraconsistent Description Logics

  AUTHORS: Norihiro Kamide

  KEYWORDS: Paraconsistent Description Logic; Paraconsistent Semantics; Four-Valued Semantics; Quasi-Classical Semantics; Single-Interpretation Semantics; Dual-Interpretation Semantics

  JOURNAL NAME: International Journal of Intelligence Science, Vol.3 No.2, April 30, 2013

  ABSTRACT: Description logics (DLs) are a family of logic-based knowledge representation formalisms with a number of computer science applications. DLs are especially well-known to be valuable for obtaining logical foundations of web ontology languages (e.g., W3C’s ontology language OWL). Paraconsistent (or inconsistency-tolerant) description logics (PDLs) have been studied to cope with inconsistencies which may frequently occur in an open world. In this paper, a comparison and survey of PDLs is presented. It is shown that four existing paraconsistent semantics (i.e., four-valued semantics, quasi-classical semantics, single-interpretation semantics and dual-interpretation semantics) for PDLs are essentially the same semantics. To show this, two generalized and extended new semantics are introduced, and an equivalence between them is proved.