Abstract
The paper describes a new algorithm for Boolean matching, which is based on BDD structure manipulation. Pruning of the search space takes place after partial assignments if certain subgraphs of two BDD's become inequivalent. This pruning is different from existing techniques, so that the search space is further reduced. Another feature of this algorithm is topological filtering. Usually, many functions have no matchings and this is easily found by only counting the number of minterms. To check it quickly, upper and lower bounds of minterm count are calculated from topological information. Using these bounds, functions that have no matchings are discarded without building their BDD's.
| Original language | English |
|---|---|
| Pages (from-to) | 219-223 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E78-D |
| Issue number | 3 |
| Publication status | Published - Mar 1995 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence