Kazumi Nakamatsu

Annotated Semantics for Defeasible Deontic Reasoning

In this paper, we propose an annotated logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) to formulate the semantics for a defeasible deontic reasoning proposed by D.Nute. We propose a translation from defeasible deontic theory into EVALPSN and show that the stable model of EVALPSN provides an annotated semantics for D. Nutes defeasible deontic logic. The annotated semantics can provide a theoretical base for an automated defeasible deontic reasoning system.

ArSLAT: Arabic Sign Language Alphabets Translator

This paper presents an automatic translation system of gestures of the manual alphabets in the Arabic sign language. The proposed Arabic Sign Language Alphabets Translator (ArSLAT) system does not rely on using any gloves or visual markings to accomplish the recognition job. As an alternative, it deals with images of bare hands, which allows the user to interact with the system in a natural way. The proposed system consists of five main phases; pre-processing phase, best-frame detection phase, category detection phase, feature extraction phase, and classification phase. The extracted features used are translation, scale, and rotation invariant, which make the system more flexible. Experiments revealed that the proposed ArSLAT system was able to recognize the 30 Arabic alphabets with an accuracy of 91.3%.

A defeasible deontic reasoning system based on annotated logic programming

In this paper, we provide a theoretical framework for a defeasible deontic reasoning system based on annotated logic programming, we propose an annotated logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) to formulate a defeasible deontic reasoning proposed by D. Nute. We also propose a translation rule from defeasible deontic theory into EVALPSN and show that the derivability of defeasible deontic theory can be translated into the satisfiability of EVALPSN stable model. The combination of a translation system from defeasible deontic theories into EVALPSNs and a computing system of EVALPSN stable models can easily provide a theoretical framework for an automated defeasible deontic reasoning system.

Intelligent real-time traffic signal control based on a paraconsistent logic program EVALPSN

In this paper, we introduce an intelligent real-time traffic signal control system based on a paraconsistent logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation), that can deal with contradiction and defeasible deontic reasoning. We show how the traffic signal control is implemented in EVALPSN with taking a simple intersection example in Japan. Simulation results for comparing EVALPSN traffic signal control to fixed-time traffic signal control are also provided.

Paraconsistent logic program based safety verification for air traffic control

It has become a crucial issue to assure the safety for air traffic control. We consider how some air traffic accidents can be avoided by verifying the safety for air traffic control logically. We propose a theoretical framework for a logical safety verification for air traffic control based on a paraconsistent logic program called an Extended Vector Annotated Logic Program with Strong Negation (EVALPSN for short). Compared to other kinds of safety verification such as safety verification for railway interlocking, the safety verification for air traffic control contains more uncertainty and sometimes has to deal with probabilistic datum. Therefore, we extend EVALPSN to probabilistic EVALPSN (P-EVALPSN for short) for dealing with the safety verification containing probability. We introduce the ideas of the safety verification based on both EVALPSN and P-EVALPSN, taking a simple example for landing clearance by air traffic controllers.

Defeasible Deontic Robot Control Based on Extended Vector Annotated Logic Programming

We have already proposed an annotated logic program called an EVALPSN (Extended Vector Annotated Logic Program with Strong Negation) to deal with defeasible deontic reasoning. In this paper, we propose a defeasible deontic action control system for a virtual robot based on EVALPSN. We suppose a beetle robot who is traveling a maze with three kinds of obstacles and has some different kinds of sensors to detect the obstacles. If some sensor values are input to the robot control, the next action that the robot should do is computed by the EVALPSN programming system.

The paraconsistent process order control method

We have already developed some kinds of paraconsistent annotated logic programs. In this paper we propose the paraconsistent process order control method based on a paraconsistent annotated logic program called before–after extended vector annotated logic program with strong negation (bf-EVALPSN) with a small example of pipeline process order verification. Bf-EVALPSN can deal with before–after relations between two processes (time intervals) in its annotations, and its reasoning system consists of two kinds of inference rules called the basic bf-inference rule and the transitive bf-inference rule. We introduce how the bf-EVALPSN-based reasoning system can be applied to the safety verification for process order.

The development of paraconsistent annotated logic programs

We have developed paraconsistent annotated logic programs called Extended Vector Annotated Logic Program with Strong Negation (EVALPSN) and applied it to various intelligent control and safety verification. We have also developed EVALPSN to deal with before-after (bf) relation between time intervals and applied it to process order control. The developed EVALPSN is called bf-EVALPSN. In this paper, we review the process of the development of EVALPSN and bf EVALPSN and introduce the details of EVALPSN defeasible deontic reasoning.

Intelligent paraconsistent logic controller and autonomous mobile robot emmy II

In this work we present a logic controller based on Paraconsistent Annotated Logic named Paracontrol, which can be applied to resolve conflicts and to deal with contradictions and/or paracompleteness, by implementing a decision-making in the presence of uncertainties. Such controller was implemented in a real autonomous mobile robot Emmy II.

Paraconsistent Before-After Relation Reasoning Based on EVALPSN

A paraconsistent annotated logic program called EVALPSN by Nakamatsu has been applied to deal with real-time safety verification and control such as pipeline process safety verification and control. In this paper, we introduce a new interpretation for EVALPSN to dynamically deal with before-after relations between two processes (time intervals) in a paraconsistent way, which is named bf-EVALPSN. We show a simple example of an EVALPSN based reasoning system that can reason before-after relations in real-time.