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.
|ジャーナル||IEICE Transactions on Information and Systems|
|出版ステータス||出版済み - 3 1 1995|
All Science Journal Classification (ASJC) codes
- コンピュータ ビジョンおよびパターン認識