ScholarLens Back to search
2007•Proceedings - ACM IEEE Design Automation ConferenceRequires access

A unified approach to canonical form-based Boolean matching

Giovanni Agosta, Francesco Bruschi, Gerardo Pelosi, Donatella Sciuto

Open publisher page 18 citations

Abstract

In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the canonical form-based approaches to the problem.

About this research paper

What this paper is about

In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the canonical form-based approaches to the problem.

Why it matters

OpenAlex reports 18 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

In this paper, we face the problem of P-equivalence Boolean matching. We outline a formal framework that unifies some of the canonical form-based approaches to the problem.

Key concepts: Computer science, Matching (statistics), Boolean function, Theoretical computer science, Algorithm, Mathematics, Statistics

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A unified approach to canonical form-based Boolean matching — Research Paper | ScholarLens