By Topic

Logical controls via Boolean rule matrix transformations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Carl G. Looney ; Dept. of Electr. Eng. & Comput. Sci., Nevada Univ., Reno, NV, USA ; Abdulrudah A. Alfize

A model is described that uses Boolean rule matrices that are equivalent to implication digraphs to transform truth states associated with rule conditions into deduced or abduced truth states. Such transformations realize propositional logic to deduce controls for complex real-time noninteractive systems. The algorithm runs in deterministically polynomial time and is easy to implement. The rule matrix is decomposable into subsystems with rule submatrices for distributed processing in multiple microprocessors. A single transformation of a truth state fires every entire implication path for which the initial, i.e. root, condition is true, whereas a user-interactive production system fires a single rule at a time and uses the output in the firing of other rules. The method can be used to perform stimulus-response-type control such as humans use to perform such feats as flying airplanes, riding bicycles, or controlling nuclear reactors.

Published in:

IEEE Transactions on Systems, Man, and Cybernetics  (Volume:17 ,  Issue: 6 )