http://popups.lib.uliege.be/1373-5411/index.php?id=138 Publications of Auteurs Jair Minoro Abe fr 0 http://popups.lib.uliege.be/1373-5411/index.php?id=2890 Fuzzy Set Theory and Paraconsistent Annotated Logics are subjects much researched nowadays, with an immense number of applications in a variety of themes. In this paper we discuss how to extend the Fuzzy set theory in order to deal with inconsistent and/or paracomplete data. For the task we use a special kind of paraconsistent annotated logic and the resulting theory, the paraconsistent annotated set theory. Tue, 03 Sep 2024 15:43:47 +0200 Thu, 10 Oct 2024 09:54:53 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2890 http://popups.lib.uliege.be/1373-5411/index.php?id=2337 This paper shows a process of prevision of medical diapostic based on Paraconsistent Annotated Logic, PAL. Knowing the symptoms reported by the patient, applying the Para-Analyzer Algorithm (Abe & Da Silva Filho 2001), by the Baricenter Analysis Method (Carvalho 2002) we obtain the resultant certainty degree of each illness analyzed (Carvalho, Brunstein & Abe 2004). Looking for the highest value of these certainty degrees we find a sole result that allows to determine the illness with highest certainty degree. We can decide what is the illness with highest favorable evidence by means of the symptoms reported by the patient. This illness will be the prevision of medical diagnosis. It is observed that the method presented is destined to 'adequate' illness, i.e., simple but helpful in emergencies, for instance. Thu, 01 Aug 2024 15:05:43 +0200 Thu, 01 Aug 2024 15:06:27 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2337 http://popups.lib.uliege.be/1373-5411/index.php?id=2002 This work is a sequel to some previous results obtained by us concerning implementation of paraconsistent electronic circuits. We investigate a projected circuit called Paraconsistent Analyzer Module (PAM) based on a kind of paraconsistent annotated logics. It was implemented by using CMOS transistors and its major function is to detect inconsistent (contradictory) signals and give a non-trivial treatment to these situations, provided by a multivalued and paraconsistent logic that underlies these studies. Fri, 19 Jul 2024 14:30:52 +0200 Thu, 10 Oct 2024 10:16:40 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2002 http://popups.lib.uliege.be/1373-5411/index.php?id=2000 In this work we present digital circuits (logical gates COMPLEMENT, AND, OR) inspired in a class of paraconsistent annotated logics Pτ. These circuits allow "inconsistent" signals in a nontrivial manner in their structure. Such circuits consist of six states; due the existence of literal operators to each of them, the underlying logic is functionally complete; it is a many-valued and paraconsistent (at least "semantically") logic. Fri, 19 Jul 2024 14:21:39 +0200 Thu, 10 Oct 2024 10:11:28 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=2000 http://popups.lib.uliege.be/1373-5411/index.php?id=1836 In this paper we present a simulator based on the paraconsistent annotated logic Eτ (Para-Sim) that allows to deal with inconsistent or paracomplete signals in a non-trivial manner, besides dealing with fuzzy information. The simulator Para-Sim allows parameters to be modified by a paraconsistent analysis and conditions in order to obtain the optimization of the qualitative notions of real size, as distance between the robot and the obstacles, and also navigation speed. Wed, 17 Jul 2024 11:11:06 +0200 Thu, 10 Oct 2024 10:15:40 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=1836 http://popups.lib.uliege.be/1373-5411/index.php?id=1621 In this paper we present a class of paraconsistent deontic systems D*τ which may constitute, for instance, a framework for the formal study of normative theory in law, in which it is important to manipulate directly the concept of contradiction. Mon, 15 Jul 2024 16:00:27 +0200 Thu, 10 Oct 2024 10:14:56 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=1621 http://popups.lib.uliege.be/1373-5411/index.php?id=132 Inconsistency is a natural phenomenona rising from the description of the real world. This phenomenon may be encountered in several situations. Nevertheless, human beings are capable of reasoning adequately. The automation of such reasoning requires the development of formal theories. Paraconsistent Logic provides tools to reason about inconsistencies. Though inconsistency is an increasingly common phenomenon in programming environments it cannot be handled, at least directly, by Classical logic, on which most of the current logic programming languages are based. Thus, one has to resort to altematives to classical logic ; it is therefore necessary to search for progtamming langages based on such alternatives. Paraconsistent logic, despite having been initially developed from the purely theoretical standpoint, found in recent years extremely fertile applications in Computer Science, thus solving the problem of justifying such logic systems from the practical standpoint. This work proposes a variation of the logic programming langage Prolog that allows inconsistency to be handled directly. The proposed langage was dubbed Paralog. Tue, 18 Jun 2024 16:09:18 +0200 Tue, 08 Oct 2024 13:43:04 +0200 http://popups.lib.uliege.be/1373-5411/index.php?id=132