A meta-interpreter based on paraconsistent legal knowledge engineering

The Legal Knowledge Engineering is a new topic of investigation of Artificial Intelligence. This paper discusses some relevant problems related to this new area in a summarized way. Within the Normative Law Theory, one question that arises naturally is that of contradiction, like for example: articles conflicting with other articles inside the same code, codes conflicting with codes, codes conflicting with jurisprudence, and in general, treatments with conflicting propositions in Normative Law Theory. This paper suggests to treat directly inconsistencies in the Legal Knowledge Engineering; this engineering has as underlying logic a paraconsistent annotated deontic logic. There are three main approximations in Legal Knowledge Engineering based on: cases, rules and logic. In this paper, we consider the approximation based on logic. It is considered a paraconsistent annotated deontic logic. Based on this logic, it is established a new proposal that is called Paraconsistent Legal Knowledge Engineering. For this proposal, it it is suggested a meta-interpreter to support the deontic operators as well as inconsistency — entitled on this paper Paralog D that can be used as a base to handle with the issues discussed

Analysis of the displacement of terrestrial mobile robots in corridors using paraconsistent annotated evidential logic e{\tau}

This article proposes an algorithm for a servo motor that controls the movement of an autonomous terrestrial mobile robot using Paraconsistent Logic. The design process of mechatronic systems guided the robot construction phases. The project intends to monitor the robot through its sensors that send positioning signals to the microcontroller. The signals are adjusted by an embedded technology interface maintained in the concepts of Paraconsistent Annotated Logic acting directly on the servo steering motor. The electric signals sent to the servo motor were analyzed, and it indicates that the algorithm paraconsistent can contribute to the increase of precision of movements of servo motors

Prosessihallinta parakonsistentilla logiikalla

In this Master’s thesis the author’s aim is to give model building tools for the temporal paraconsistent logic program called Before-After Extended Vector Annotated Logic Program with Strong Negation (bf-EVALPSN), originally created by Professor Kazumi Nakamatsu of the Prefectural University of Hyogo, Japan. The tools bridge the paraconsistent logic program language with finite state automata

Towards an efficient prover for the C1 paraconsistent logic

The KE inference system is a tableau method developed by Marco Mondadori which was presented as an improvement, in the computational efficiency sense, over Analytic Tableaux. In the literature, there is no description of a theorem prover based on the KE method for the C1 paraconsistent logic. Paraconsistent logics have several applications, such as in robot control and medicine. These applications could benefit from the existence of such a prover. We present a sound and complete KE system for C1, an informal specification of a strategy for the C1 prover as well as problem families that can be used to evaluate provers for C1. The C1 KE system and the strategy described in this paper will be used to implement a KE based prover for C1, which will be useful for those who study and apply paraconsistent logics.Comment: 16 page

Matrix proof method in annotated paraconsistent logic

The matrix connection method (MCM) is an alternative procedure for theorem proving than the usual resolution technique. We already have used the MCM for finding models in a real-time knowledge-based system generator. In this paper, we adapt the MCM to the particular case of sorne annotated propositional paraconsistent logics. Further developments related to these ideas are also outlined.Eje: 2do. Workshop sobre aspectos teóricos de la inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI