Fast sequential evaluation of monotonic Boolean functions

A correspondence between the factored form representation of monotonic Boolean functions and the sequential evaluation procedures for them is shown to exist. Based on such a relationship, a criterion is developed for obtaining the cost of the sequential procedure directly from the factored form representation. Making use of this criterion, a simple algorithm is presented to determine the fast sequential evaluation procedure for monotonic Boolean functions.