[1] |
Cook S A. The complexity of theoremproving procedures[C]∥Proc of the 3rd ACM Symposium on Theory of Computing. 1971:151158.
|
[2] |
Zhou Jin,Zhao Xishun. A survey of SAT algorithm based FPGA[J]. Electronics World,2012(3):6069.(in Chinese)
|
[3] |
Davis M,Logemann M,Loveland D.A machine program for theorem proving[J]. Communication of the ACM, 1962,5(7):394397.
|
[4] |
Davis M,Putnam H. A computer procedure for quantification theory[J].Journal of the ACM,1960,7(3):202215.
|
[5] |
Zhang Lintao,Malik S.The quest for efficient boolean satisfiability solvers[C]∥Proc of the 14th International Conference on Computer Aided Verification,2002:1736.
|
[6] |
Kanazawa K,Maruyama T. An FPGA solver for WSAT algorthm[C]∥IEEE Proceedings,2005:978981.
|
[7] |
Kanazawa K,Maruyama T. An approach for solving large SAT problems on FPGA[J].ACM Transactions on Reconfigurable Technology and Systems,2010,4(1):488496.
|
[8] |
Kanazawa K, Maruyama T. An FPGA solver for SATencoded formal verification problems[C]∥Proc of FPL’11,2011:3843.
|
[9] |
Kanazawa K, Maruyama T. Solving SATencoded formal verification problems on SoC based on a WSAT algorithm with a new heuristic for hardware acceleration[C]∥Proc of International Symposium on Embedded Multicore/Manycore SystemonChip,2013:101106.
|
[10] |
Kanazawa K, Maruyama T. FPGA acceleration of SATMaxSAT solving using variableway cache[C]∥Proc of FPL’14,2014:1.
|
[11] |
Yokoo M,Suyama T,Sawada H. Solving satisfiability problems using field programmable gate arrays:First results[C]∥Proc of Principles and Practice of Constraint Programming(CP’96),1996:497509.
|
[12] |
Suyama T,Yokoo M,Sawada H,et al,Solving satisfiability problems using reconfigurable computing [J].IEEE Transactions on Very Large Scale Integration (VLSI) Systems,2001,9(1):109116.
|
[13] |
Zhong P,Ashar P,Malik S,et al. Using reconfigurable computing techniques to accelerate problems in the CAD domain:A case study with boolean satisfiability [C]∥Proc of the 35th Annual Design Automation Conference,1998:194199.
|
[14] |
Zhong P,Martonosi M,Ashar P,et al. Accelerating Boolean satisfiability with configurable hardware[C]∥Proc of IEEE Symposium on FPGAs for Custom Computing Machines,Proceedings,1998:186195.
|
[15] |
Zhong P, Martonosi M, Ashar P. FPGAbased SAT solver architecture with nearzero synthesis and layout overhead[C]∥Proc of Computers and Digital Techniques,IEEE Proceedings, 2000:135141.
|
[16] |
Safar M, ElKharashi M W,Shalan M, et al. A reconfigurable,pipelined,conflict directed jumping search SAT solver [C]∥Proc of Design,Automation and Test in Europe,2011:978981.
|
[17] |
Ivan T,Aboulhamid E l M. An efficient hardware implementation of a SAT problem solver on FPGA[C]∥Euromicro Conference on Digital System Design,2013.
|
[18] |
Haller L,Singh S. Relieving capacity limits on FPGAbased SATsolvers[C]∥Proc of FMCAD’13,2013:217220.
|
[19] |
Davis J D,Tan Zhangxi. A practical reconfigurable hardware accelerator for boolean satisfiability solvers[C]∥Proc of DAC’08,2008:780785.
|
[20] |
Thong J,Nicolic N. FPGA acceleration of enhanced boolean constraint propagation for SAT solvers[C]∥Proc of ICCAD’13,2013:234241.
|
|
附中文参考文献:
|
[2] |
周进,赵希顺. 基于硬件可编程逻辑(FPGA)的SAT算法的综述[J].电子世界,2012(3):6069.
|