Open AccessApplication of paraconsistent annotated logic program bf-EVALPSN to intelligent control
Author(s) -
Kazumi Nakamatsu
Publication year - 2013
Publication title -
facta universitatis. series electronics and energetics/facta universitatis. series: electronics and energetics
Language(s) - English
Resource type - Journals
eISSN - 2217-5997
pISSN - 0353-3670
DOI - 10.2298/fuee1301011n
Subject(s) - defeasible estate , computer science , transitive relation , inference , relation (database) , reasoning system , rule of inference , defeasible reasoning , paraconsistent logic , artificial intelligence , deontic logic , model based reasoning , programming language , non monotonic logic , simple (philosophy) , process (computing) , logic program , theoretical computer science , knowledge representation and reasoning , logic programming , mathematics , data mining , description logic , higher order logic , combinatorics , philosophy , epistemology
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.