Abstract :
This paper presents methods for iterative evaluation of Boolean expressions suitable, e. g., in sequential search and matching when the input variables appear in sequence. The sum-of-product form is assumed and the clue is to partially compute the values of all products partially for each new variable being defined. It is shown that the additive use of an expression for the complementary function can result in a faster evaluation. The method proves to be extendable to multilevel expressions.
