ScholarLens Back to search
2017•Unpublished venueRequires access

On evolutionary algorithms for Boolean functions minimization

B. Ilyin, A. S. Kazimirov, V. I. Panteleyev, S. Yu. Reimerov, N. Semicheva

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Boolean function, Circuit minimization for Boolean functions, Boolean circuit, Minification, Product term, Algorithm, Boolean expression, Maximum satisfiability problem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On evolutionary algorithms for Boolean functions minimization — Research Paper | ScholarLens