Paraconsistent logic

About: Paraconsistent logic is a research topic. Over the lifetime, 1610 publications have been published within this topic receiving 28842 citations.

Strong Paraconsistency and the Basic Constructive Logic for an Even Weaker Sense of Consistency

Abstract: In a standard sense, consistency and paraconsistency are understood as the absence of any contradiction and as the absence of the ECQ (`E contradictione quodlibet') rule, respectively. The concepts of weak consistency (in two different senses) as well as that of F-consistency have been defined by the authors. The aim of this paper is (a) to define alternative (to the standard one) concepts of paraconsistency in respect of the aforementioned notions of weak consistency and F-consistency; (b) to define the concept of strong paraconsistency; (c) to build up a series of strongly paraconsistent logics; (d) to define the basic constructive logic adequate to a rather weak sense of consistency. All logics treated in this paper are strongly paraconsistent. All of them are sound and complete in respect a modification of Routley and Meyer's ternary relational semantics for relevant logics (no logic in this paper is relevant).

A sensing system for an autonomous mobile robot based on the paraconsistent artificial neural network

Abstract: This paper shows a sensing system for an autonomous mobile robot. The Sensing System is based on the Paraconsistent Neural Network. The type of artificial neural network used in this work is based on the Paraconsistent Evidential Logic - Eτ. The objective of the Sensing System is to inform the other robot components the position where there is an obstacle. The reached results have been satisfactory.

Paraconsistent reasoning for semantic web agents

Abstract: Description logics refer to a family of formalisms concentrated around concepts, roles and individuals. They are used in many multiagent and Semantic Web applications as a foundation for specifying knowledge bases and reasoning about them. Among them, one of the most important logics is $\mathcal{SROIQ}$, providing the logical foundation for the OWL 2 Web Ontology Language recommended by W3C in October 2009. In the current paper we address the problem of inconsistent knowledge. Inconsistencies may naturally appear in the considered application domains, for example as a result of fusing knowledge from distributed sources. We introduce a number of paraconsistent semantics for $\mathcal{SROIQ}$, including three-valued and four-valued semantics. The four-valued semantics reflects the well-known approach introduced in [5,4] and is considered here for comparison reasons only. We also study the relationship between the semantics and paraconsistent reasoning in $\mathcal{SROIQ}$ through a translation into the traditional two-valued semantics. Such a translation allows one to use existing tools and reasoners to deal with inconsistent knowledge.