A software/reconfigurable hardware SAT solver

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Volumn 12, Issue 4, 2004, Pages 408-419

  Skliarova, Iouliia ^a   Ferrari, António B ^a  

^a UNIVERSITY OF AVEIRO   (Portugal)

Author keywords

Boolean satisfiability; Configurable computing; Field programmable gate array (FPGA); Partitioning

Indexed keywords

APPLICATION SPECIFIC INTEGRATED CIRCUITS; ARTIFICIAL INTELLIGENCE; COMPUTATION THEORY; COMPUTER AIDED DESIGN; COMPUTER HARDWARE; COMPUTER SOFTWARE; PROBLEM SOLVING; PROGRAM COMPILERS;

BOOLEAN SATISFIABILITY (SAT); CONFIGURABLE COMPUTING; HARDWARE PLATFORM; PARTITIONING;

FIELD PROGRAMMABLE GATE ARRAYS;

EID: 2442713051     PISSN: 10638210     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVLSI.2004.825859     Document Type: Conference Paper

References (25)

1. G. Micheli, Synthesis and Optimization of Digital Circuits: McGraw-Hill, 1994.
2. P. Stephan, R. K. Brayton, and A. L. Sangiovanni-Vincentelli, "Combinational test generation using satisfiability," IEEE Trans. ComputerAided Design, vol. 15, pp. 1167-1176, Sept. 1996.
3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
4. D. Abramson, P. Logothetis, A. Postula, and M. Randall, "FPGA based custom computing machines for irregular problems," in Proc. 4th Int. Symp. High-Performance Computer Architecture (HPCA), Las Vegas, NV, Feb. 1998.
5. T. Suyama, M. Yokoo, H. Sawada, and A. Nagoya, "Solving satisfiability problems using reconfigurable computing," IEEE Trans. VLSI Syst., vol. 9, pp. 109-116, Feb. 2001.
6. P. Zhong, M. Martonosi, P. Ashar, and S. Malik, "Solving Boolean satisfiability with dynamic hardware configurations," in Field-Programmable Logic: From FPGAs to Computing Paradigm, R. W. Hartenstein and A. Keevallik, Eds, Berlin, Germany: Springer-Verlag, Aug./Sept. 1998, pp. 326-335.
7. M. Abramovici and J. T. de Sousa, "A SAT solver using reconfigurable hardware and virtual logic," J. Automated Reasoning, vol. 24, no. 1-2, pp. 5-36, Feb. 2000.
8. P. Zhong, "Using Configurable Computing to Accelerate Boolean Satisfiability," Ph.D. dissertation, Dept. Elect. Eng., Princeton Univ., Princeton, NJ, June 1999.
9. J. Gu, P. W. Purdom, J. Franco, and B. W. Wah, "Algorithms for the satisfiability (SAT) problem: A survey," DIMACS Series Discrete Math. Theoretical Comput. Sci., vol. 35, pp. 19-151, 1997.
10. M. Davis, G. Logemann, and D. Loveland, "A machine program for theorem proving," Commun. ACM, no. 5, pp. 394-397, 1962.
11. J. M. Silva and K. A. Sakallah, "GRASP: A search algorithm for prepositional satisfiability," IEEE Trans. Computers, vol. 48, pp. 506-521, May 1999.
12. R. J. Bayardo, Jr. and R. C. Schrag, "Using CSP look-back techniques to solve real-world SAT instances," in Proc. 14th National Conf. Artificial Intelligence, 1997, pp. 203-208.
13. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an efficient SAT solver," in Proc. 38th Design Automation Conf., June 2001, pp. 530-535.
14. E. Goldberg and Y. Novikov, "BerkMin: A fast and robust SAT-solver," in Proc. Design, Automation Test Europe Conf., 2002, pp. 142-149.
15. P. Zhong, P. Ashar, S. Malik, and M. Martonosi, "Using reconfigurable computing techniques to accelerate problems in the CAD domain: A case study with Boolean satisfiability," in Proc. Design Automation Conf., 1998, pp. 194-199.
16. M. Abramovici and D. Saab, "Satisfiability on reconfigurable hardware," in Proc. 7th Int. Workshop Field-Programmable Logic Applications, 1997, pp. 448-456.
17. M. Platzner and G. De Micheli, "Acceleration of satisfiability algorithms by reconfigurable hardware," in Field-Programmable Logic: From FPGA's to Computing Paradigm, R. W. Hartenstein and A. Keevallik, Eds, Berlin, Germany: Springer-Verlag, Aug./Sept. 1998, pp. 69-78.
18. O. Mencer and M. Platzner, "Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment," in Proc. 32nd Hawaii Int. Conf. System Sciences (HICSS), Maui, HI, Jan. 5-8, 1999.
19. T. Suyama, M. Yokoo, and H. Sawada, "Solving satisfiability problems using logic synthesis and reconfigurable hardware," in Proc. 31st Hawaii Int. Conf. System Sciences, vol. 7, 1998, pp. 179-186.
20. M. Boyd and T. Larrabee, "ELVIS - A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems," in Proc. 8th IEEE Int. Symp. Field-Programmable Custom Computing Machines, Napa Valley, CA, Apr. 16-19, 2000.
21. J. de Sousa, J. P. Marques-Silva, and M. Abramovici, "A configware/software approach to SAT solving," in Proc. 9th IEEE Int. Symp. Field-Programmable Custom Computing Machines, 2001.
22. DIMACS challenge benchmarks [Online]. Available: http://www.intellektik. informatik.tu-darmstadt.de/SATLIB/benchm.html
23. A. D. Zakrevski, Logical Synthesis of Cascade Networks, Moscow, Russia: Science, 1981. in Russian.
24. Alpha Data [Online]. Available: http://www.alpha-data.com
25. Xilinx [Online]. Available: http://www.xilinx.com/xlnx/xweb/ xil_publications_index.jsp