On generating binary decision trees with minimum nodes
W. H. Dailey · ACM SIGPLAN Notices · 1975
This paper describes a technique for generating binary decision trees from decision tables. It starts with a fully expended table and does a partial reduction with respect to the actions. The remainder of the reduction is done without reference to actions. Pollack's algorithm is finally applied to determine the next decision to consider.