FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers

We present an FPGA-based accelerator for 3-SAT clause evaluation and conflict diagnosis and propose an approach to incorporate it in solving the Combinational Equivalence Checking problem. SAT binary clauses are mapped onto an implication graph and the ternary clauses are kept in an indexed clause database and mapped into the clause evaluator and conflict analyzer on FPGA.

[1]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[2]  Scott Hauck,et al.  Reconfigurable computing: a survey of systems and software , 2002, CSUR.

[3]  Iouliia Skliarova,et al.  Reconfigurable hardware SAT solvers: a survey of systems , 2003, IEEE Transactions on Computers.

[4]  Tracy Larrabee,et al.  Test pattern generation using Boolean satisfiability , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Sharad Malik,et al.  Using configurable computing to accelerate Boolean satisfiability , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Joao Marques-Silva,et al.  Solving satisfiability in combinational circuits , 2003, IEEE Design & Test of Computers.

[7]  Joao Marques-Silva,et al.  GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[8]  Sherief Reda,et al.  Combinational equivalence checking using Boolean satisfiability and binary decision diagrams , 2001, Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001.