Speeding up SAT for EDA
Slawomir Pilarski, Guanshi Hu · 2002
This paper presents performance results for a new SAT solver designed specifically for EDA applications. The new solver significantly outperforms most efficient SAT solvers -- Chaff[2], SATO[3], and GRASP[1] -- on a large set of benchmarks. Performance improvements for standard benchmark groups vary from 1.5x to 60x. They were achieved through a new decision-making strategy and more efficient boolean constraint propagation (BCP).