Premium
Extension of O‐theory to problems of logical inferencing
Author(s) -
Oblow E. M.
Publication year - 1989
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.4550040202
Subject(s) - modus ponens , logical connective , non classical logic , propositional calculus , extension (predicate logic) , operator (biology) , computer science , rule of inference , logical conjunction , inference , logical reasoning , logical analysis , theoretical computer science , algebra over a field , mathematics , artificial intelligence , logical consequence , pure mathematics , programming language , biochemistry , chemistry , mathematical statistics , statistics , repressor , transcription factor , gene
This article extends Operator‐Uncertainty Theory (OT) to the problem of uncertainty propagation in logical inferencing systems. the OT algebra and propositional interpretations presented in previous articles are applied here to derive operators for logical inferencing in the presence of conflict and undecidability. Operators for propagating uncertainties through the logical operations of disjunction and conjunction are defined. In addition, new OT operators for implication, modus ponens and modus tollens, are also proposed. the operators derived using the OT methodology are found to give rise to a four‐valued logic similar to that used in computer circuit design. This framework allows uncertainty in inferencing to be represented in the form of rules convenient for use in expert systems as well as logical networks. the theory is general enough to deal with questions of conflict and undecidability, and to propagate their effects through the most widely used inference operations.