Incremental learning approach and SAT model for Boolean matching with don't cares

@inproceedings{Wang2007IncrementalLA,
  title={Incremental learning approach and SAT model for Boolean matching with don't cares},
  author={Kuo-Hua Wang and Chung-Ming Chan},
  booktitle={ICCAD 2007},
  year={2007}
}
In this paper, we will propose an incremental learning approach to solve Boolean matching for incompletely specified functions. This approach can incrementally analyze current feasible partial mappings, detect and eliminate redundant manipulations in a proactive way. A new type of signature exploiting single variable symmetries is also given to reduce the searching space. Moreover, a SAT model of Boolean matching will be proposed to handle large Boolean functions. Through the utilization of… CONTINUE READING

Topics from this paper.