Formulation for the computation of Boolean operations

Boolean or switching equations are powerful mathematical tools for digital logic. Several problems in digital circuit design, such as automatic test pattern generation, could be efficiently solved if fast procedures for solving Boolean equations were available. Several methods for solving this class of equations have been developed, but their efficiency is a problem. A new formulation for the computation of Boolean operations based on cubic representation of Boolean functions, termed the cube set method, is presented. The solutions provided by this approach are given as a set of cubes satisfying the disjoint property. Some definitions and theorems are given to describe the method and experimental results are presented