Defeasible Deontic Reasoning Research Articles

Application of paraconsistent annotated logic program bf-EVALPSN to intelligent control

A paraconsistent annotated logic program called EVALPSN has been developed for dealing with defeasible deontic reasoning and plausible reasoning, and applied to various kinds of intelligent control and safety verification. Moreover, in order to deal with before-after relation between processes(time intervals), bf(before-after)-EVALPSN has also been developed recently. In this paper, we review the reasoning system for before-after relation between processes based on bf- EVALPSN. The system consists of two groups of inference rules in bf-EVALPSN called basic and transitive bf-inference rules. The application of the reasoning system to real-time process order control is introduced with simple examples.

A logical reasoning system of process before-after relation based on a paraconsistent annotated logic program bf-EVALPSN

A paraconsistent annotated logic program called EVALPSN has been developed for dealing with defeasible deontic reasoning and plausible reasoning, and applied to various kinds of intelligent control and safety verification. Moreover, in order to deal

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.

An Intelligent Action Control System Based on Extended Vector Annotated Logic Program and its Hardware Implementation

Abstract Vazious intelligent control systems for autonomous machines have been developed, and such intelligent control systems often require real time processing. However, it is difficult for software control to realize fast real time processing. Therefore, intelligent control systems that can be easily hardware implemented are expected. We propose a theoretical framework for intelligent autonomous action control systems based on a paraconsistent logic program called an EVALPSN. The paraconsistent logic program EVALPSN can deal with defeasible deontic reasoning and conflicts, and is appropriate for hazdware implementation. In order to show the feature of the intelligent action control, we take a virtual beetle robot action control system as an example. Moreover, we introduce the electronic circuit implementation for the robot action control system with experimental results.

注釈真理値付き論理プログラムのパイプラインプロセス安全性検証への応用

We have developed a paraconsistent annotated logic program called Extended Vector Annotated Logic Program with Strong Negation (abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction, and we have already applied it to safety verification and control such as railway interlocking safety verification and traffic signal control. In this paper, we introduce process safety verification as an application of EVALPSN with a small example for brewery pipeline valve control. The safety verification control is based on EVALPSN defeasible deontic reasoning to avoid unexpected mix of different sorts of liquid in pipeline networks.

Pipeline Valve Control Based on EVALPSN Safety Verification

We have developed an annotated logic program called an Extended Vector Annotated Logic Program with Strong Negation (abbr. EVALPSN), which can deal with defeasible deontic reasoning and contradiction. We have already applied EVALPSN to safety verification and control such as railway interlocking safety verification. In this paper, we show how to apply EVALPSN to pipeline valve control with an example for brewery pipeline valve control. The safety verification control is based on EVALPSN programming to avoid unexpected mix of different sorts of liquid.

Two approaches to the formalisation of defeasible deontic reasoning

This paper compares two ways of formalising defeasible deontic reasoning, both based on the view that the issues of conflicting obligations and moral dilemmas should be dealt with from the perspective of nonmonotonic reasoning. The first way is developing a special nonmonotonic logic for deontic statements. This method turns out to have some limitations, for which reason another approach is recommended, viz. combining an already existing nonmonotonic logic with a deontic logic. As an example of this method the language of Reiter's default logic is extended to include modal expressions, after which the argumentation framework in default logic of [20, 22] is used to give a plausible logical analysis of moral dilemmas and prima facie obligations.

Defeasible deontic reasoning and its applications to normative systems

Our interests are in the application of deontic logic for the modelling of regulations in commercial law and other social institutions. We provide a first-order framework of deontic reasoning that can model and compute social regulations and rules. This effort has practical importance due to the ubiquity and complexity of social regulations and norms. Computer-mediated modelling of norms may reduce the overhead of managing complex social norms and avoid inefficiencies and social inequity resulting from complex and ill-maintained social norms. In order to achieve the goal, we apply defeasible reasoning, a clausal form logic programming approach, and capture deontic concepts in first-order representations. The proposed formalism is applied to the modelling of normative systems such as bureaucratic regulations and legal reasoning.