New algorithm for Boolean matching utilizing structural information

研究成果: Contribution to journalArticle査読

4 被引用数 (Scopus)

抄録

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.

本文言語英語
ページ(範囲)219-223
ページ数5
ジャーナルIEICE Transactions on Information and Systems
E78-D
3
出版ステータス出版済み - 3 1 1995
外部発表はい

All Science Journal Classification (ASJC) codes

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ビジョンおよびパターン認識
  • 電子工学および電気工学
  • 人工知能

引用スタイル