On evolutionary algorithms for Boolean functions minimization

Abstract

This paper concerns evolutionary algorithms for minimization exclusive-or sum-of-products representations of Boolean functions. These representations are used in logic synthesis for certain class of circuits. Minimization is based on a decomposition for Boolean functions with parameter function. Selection of this function is a search task which can be solved with evolutionary algorithms. Algorithms for obtaining approximately minimal formulas for Boolean functions of up to 8 variables are proposed.