Paraconsistent Rough Description Logic

In [7], a fuzzy logic f -EL ++ with a polynomial-time subsumption algorithm was specially defined to deal with imprecise and vague knowledge.. Unfortunately, this logic cannot

introduced by Patel-Schneider [13], three inconsistency-tolerant constructive de- scription logics, which are based on intuitionistic logic, were studied by Odintsov and Wansing

gives meaning to OWL knowledge bases and deter- mines their logical consequences, is based on DL semantics, and the automated tools used to reason over OWL knowledge bases are

Here, our construction is very similar to the classical case: instead of (classical) modal formula, we use negated formulas in the construction of the canonical model (and

As we stated earlier, we use the paraconsistent rela- tion model (Bagai and Sunderraman 1995) to find the QC model for any given positive extended disjunctive deductive database.

We begin with the five-valued semantics, whose motivation stems from the fact that, for the three-valued MKNF seman- tics [Knorr et al., 2011], with truth values true, false and

In this paper we introduce the notion of genuine paracomplete logic, these logics are presented as logics rejecting the dual principles that define genuine para- consistent logic..

Some systems of many-valued logics are presented as families of uniformly defined finite-valued and infinite-valued systems, for example, Lukasiewicz logic, G¨ odel logic, t-Norm