Transitive reasoning of before-after relation based on Bf-EVALPSN

7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A paraconsistent annotated logic program called bf-EVALPSN has been developed for dealing with before-after relations between processes and applied to real-time process order control. In order to increase the efficiency of bf-EVALPSN process order control, a transitive reasoning system of before-after relations in bf-EVALPSN is introduced. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Nakamatsu, K., Abe, J. M., & Akama, S. (2008). Transitive reasoning of before-after relation based on Bf-EVALPSN. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5178 LNAI, pp. 474–482). Springer Verlag. https://doi.org/10.1007/978-3-540-85565-1_59

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free