Abstract
WSAT and its variants are one of the best performing stochastic local search algorithms for the satisfiability (SAT) problem. In this article, we propose an approach for solving large 3-SAT problems on FPGA using a WSAT algorithm. In hardware solvers, it is important to solve large problems efficiently. In WSAT algorithms, an assignment of binary values to the variables that satisfy all clauses is searched by repeatedly choosing a variable in an unsatisfied clause using a heuristic, and flipping its value. In our solver, (1) only the clauses that may be unsatisfied by the flipping are evaluated in parallel to minimize the circuit size, and (2) several independent tries are executed at the same time on the pipelined circuit to achieve high performance. Our FPGA solver can solve larger problems than previous works with less hardware resources, and shows higher performance.
- Anbulagan, Pham, D. N., Slaney, J., and Sattar, A. 2005. Old resolution meets modern SLS. In Proceedings of the National Conference on Artificial Intelligence (AAAI’05). 354--359. Google Scholar
Digital Library
- Hoos, H. H. and Stutzle, T. 1999. Local search algorithms for SAT: An empirical evaluation. J. Autom. Reason. 24, 421--481. Google Scholar
Digital Library
- Hoos, H. H. and Tompkins, D. A. D. 2007. Adaptive novelty+. SAT Competition 2007.Google Scholar
- Kanazawa, K. and Maruyama, T. 2005. An FPGA solver for WSAT algorithms. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’05). 83--88.Google Scholar
- Kanazawa, K. and Maruyama, T. 2006a. An FPGA solver for large SAT problems. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’06). 243--258.Google Scholar
- Kanazawa, K. and Maruyama, T. 2006b. An FPGA solver for WSAT algorithms. IEICE Trans. Inform. Syst. J89-D, 6, 1173--1181 (in Japanese).Google Scholar
- Kanazawa, K. and Maruyama, T. 2007a. An FPGA solver for large SAT problems. IEICE Trans. Inform. Syst. J90-D, 10, 2713--2722 (in Japanese).Google Scholar
- Kanazawa, K. and Maruyama, T. 2007b. An FPGA solver for very large SAT problems. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’07). 493--496.Google Scholar
- Leong, P. H. W., Sham, C. W., Wong, W. C., Wong, H. Y., Yuen, W. S., and Leong, M. P. 2001. A bitstream reconfigurable FPGA implementation of the WSAT algorithm. IEEE Trans. VLSI Syst. 9, 1, 197--201. Google Scholar
Digital Library
- McAllester, D., Selman, B., and Kautz, H. 1997. Evidence for invariants in local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI’97). 321--326. Google Scholar
Digital Library
- Pham, D. N. and Anbulagan. 2007. Resolution enhanced sls solver: R+adaptnovelty+. SAT Competition 2007.Google Scholar
- Selman, B., Kautz, H. A., and Cohen, B. 1994. Noise strategies for improving local search. In Proceedings of the National Conference on Artificial Intelligence (AAAI’94). 337--343. Google Scholar
Digital Library
- Skliarova, I. and Ferrari, A. B. 2004. Reconfigurable hardware SAT solvers: A survey of systems. IEEE Trans. Comput. 53, 11, 1449--1461. Google Scholar
Digital Library
- Yap, R., Wang, S., and Henz, M. 2003. Real-time reconfigurable hardware WSAT variants. In Proceedings of the International Conference on Field Programmable Logic and Applications (FPL’03). 488--496.Google Scholar
Index Terms
An Approach for Solving Large SAT Problems on FPGA
Recommendations
Solving the resolution-free SAT problem by submodel propagation in linear time
We present a method, called Unicorn-SAT, based on submodel propagation, which solves the resolution-free SAT problem in linear time. A formula is resolution-free if there are no two clauses which differ only in one variable, i.e., each clause is blocked ...
Solving the Resolution-Free SAT Problem by Submodel Propagation in Linear Time
We present a method, called Unicorn-SAT, based on submodel propagation, which solves the resolution-free SAT problem in linear time. A formula is resolution-free if there are no two clauses which differ only in one variable, i.e., each clause is blocked ...
Approximating Quantified SMT-Solving with SAT
SSIRI-C '11: Proceedings of the 2011 Fifth International Conference on Secure Software Integration and Reliability Improvement - CompanionSatisfiability Modulo Theories (SMT) is an extension of SAT towards FOL. SMT solvers have proven highly scalable and efficient for problems based on some ground theorems. However, SMT problems involving quantifiers and combination of theorems is a long-...






Comments