Abstract
We present an FPGA-based hardware solution to the Boolean satisfiability (SAT) problem, with the main goals of scalability and speedup. In our approach the traversal of the implication graph as well as conflict clause generation are performed in hardware, in parallel. The experimental results and their analysis, along with the performance models are discussed. We show that an order of magnitude improvement in runtime can be obtained over MiniSAT (the best-in-class software based approach) by using a Virtex-4 (XC4VFX140) FPGA device. The resulting system can handle instances with as many as 10K variables and 280K clauses.
- Abramovici, M., de Sousa, J., and Saab, D. 1999. A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware. In Design Automation Conference. 684--690. Google ScholarDigital Library
- Cook, S. 1971. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM Symposium Theory of Computing. 151--158. Google ScholarDigital Library
- Goldberg, E. and Novikov, Y. 2002. BerkMin: A fast and robust SAT solver. In Proceedings of the Design, Automation and Test in Europe (DATE) Conference. 142--149. Google ScholarDigital Library
- Gu, J., Purdom, P., Franco, J., and Wah, B. 1997. Algorithms for the satisfiability (SAT) problem: A survey. In Discrete Math. and Theoretical Computer Science, DIMACS, Rutgers, NJ, 19--151.Google Scholar
- Gulati, K., Waghmode, M., Khatri, S., and Shi, W. 2008. Efficient, scalable hardware engine for Boolean satisfiability and unsatisfiable core extraction. IET Comput. Digit. Teclin. 2, 3, 214--229.Google ScholarCross Ref
- Mencer, O. and Platzner, M. 1999. Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment. In Proceedings of the 32nd Annual Haubiiau International Conference on System Sciences. 3044--3052. Google ScholarDigital Library
- Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., and Malik, S. 2001. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference. 530--535. Google ScholarDigital Library
- Pagarani, T., Kocan, F., Saab, D., and Abraham, J. 2000. Parallel and scalable architecture for solving Satisfiability on reconfigurable FPGA. In Proceedings of the Custom Integrated Circuit Conference. 147--150.Google Scholar
- Platzner, M. and Micheli, G. D. 1998. Acceleration of satisfiability algorithms by reconfigurable hardware. In Field-Programmable Logic and Applications, Springer-Verlag, 69--78. Google ScholarDigital Library
- Redekopp, M. and Dandalis, A. 2000. A parallel pipelined SAT solver for FPGAs. In Proceedings of the Field Programmable Logic. Springer-Verlag, 462--468. Google ScholarDigital Library
- Safar, M., El-Kharashi, M., and Salem, A. 2006. FPGA-based SAT solver. In Proceedings of the Canadian Conference on Electrical and Computer Engineering. 1901--1904.Google Scholar
- Safar, M., Shalan, M., El-Kharashi, M. W., and Salem, A. 2007. Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver. In Proceedings of the Conference and Exhibition on Design, Automation and Testing Europe (DATE). 153--158. Google ScholarDigital Library
- Silva, M. and Sakallah, J. 1996. GRASP-a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer-Aided Design (ICCAD). 220--227. Google ScholarDigital Library
- Skliarova, I. and Ferrari, A. 2004a. Reconfigurable hardware SAT solvers: A survey of systems. IEEE Trans. Comput. 53, 11, 1449--1461. Google ScholarDigital Library
- Skliarova, I. and Ferrari, A. B. 2004b. A software/reconfigurable hardware SAT solver. IEEE Trans. VLSI Syst. 12, 4, 408--419. Google ScholarDigital Library
- Suyama, T., Yokoo, M., Sawada, H., and Nagoya, A. 2001. Solving satisfiability problems using reconfigurable computing. IEEE Trans. VLSI Syst. 9, 1 (Feb), 109--116. Google ScholarDigital Library
- Zhao, Y., Malik, S., Wang, A., Moskewicz, M., and Madigan, C. 2001. Matching architecture to application via configurable processors: A case study with Boolean Satisfiability problem. In Proceedings of the International Conference on Computer Design (ICCD). 447--452. Google ScholarDigital Library
- Zhong, P., Martonosi, M., Ashar, P., and Malik, S. 1998. Accelerating Boolean Satisfiability with configurable hardware. In FPGAs for Custom Computing Machines, 186--195. Google ScholarDigital Library
Index Terms
- FPGA-based hardware acceleration for Boolean satisfiability
Recommendations
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
DAC '08: Proceedings of the 45th annual Design Automation ConferenceWe present a practical FPGA-based accelerator for solving Boolean Satisfiability problems (SAT). Unlike previous efforts for hardware accelerated SAT solving, our design focuses on accelerating the most time consuming part of the SAT solver --- Boolean ...
A satisfiability procedure for quantified boolean formulae
The renesse issue on satisfiabilityWe present a satisfiability tester QSAT for quantified Boolean formulae and a restriction QSATCNF of QSAT to unquantified conjunctive normal form formulae. QSAT makes use of procedures which replace subformulae of a formula by equivalent formulae. By a ...
Backjumping for quantified Boolean logic satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Many decision procedures have been proposed in the last few years, most of ...
Comments