ScholarLens Back to search
2005•Unpublished venueRequires access

Towards a Symbolic Logic Minimization Algorithm

Olivier Coudert, J.C. Madre

Open publisher page 13 citations

Abstract

This paper presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [ll].

About this research paper

What this paper is about

This paper presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [ll].

Why it matters

OpenAlex reports 13 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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 presents the application of the recently introduced implicit sets of products manipulations based on binary decision diagrams to the generation of irredundant prime covers of Boolean functions and of multiple output Boolean functions. The results obtained with this procedure are compared with the ones obtained with ESPRESSO and with the procedure presented in [ll].

Key concepts: Binary decision diagram, Boolean function, Implicant, Circuit minimization for Boolean functions, Minification, Computer science, Algorithm, And-inverter graph

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Towards a Symbolic Logic Minimization Algorithm — Research Paper | ScholarLens