Defeasible Deontic Control for Discrete Events Based on EVALPSN

Abstract

AbstractWe have developed an annotated logic program called an EVALPSN(Extended Vector Annotated Logic Program with Strong Negation), which can deal with defeasible deontic reasoning and some kinds of contradiction, and applied EVALPSN to automatic safety verification, traffic signal control, robot action control, etc.. Generally, discrete event control can be represented as deontic rules such as it is forbidden for both the cat and mouse to occupy the same room simultaneously, and must deal with contradiction to avoid unexpected system states. We show that such discrete event control can be easily formalized in EVALPSN. In this paper, we introduce the application of EVALPSN to discrete event control with taking a famous example Cat and Mouse.Keywordsannotated logic programparaconsistent logicdiscrete event systemsdefeasible deontic reasoningEVALPSN