Zchaff2004: An efficient SAT solver

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 360-375

  Mahajan, Yogesh S ^a   Fu, Zhaohui ^a   Malik, Sharad ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATION; COMPUTATIONAL METHODS; MOTIVATION; PROBLEM SOLVING;

BOOLEAN SATISFIABILITY PROBLEM (SAT); DIVERSE DOMAINS; ELECTRONIC DESIGN; NP-COMPLETE PROBLEM;

BOOLEAN ALGEBRA;

EID: 26444568158     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_27     Document Type: Conference Paper

References (38)

1. Cook, S.A.: The complexity of theorem-proving procedures. In: Third Annual ACM Symposium on Theory of Computing. (1971)
2. Kautz, H., Selman, B.: Planning as Satisfiability. In: European Conference on Artificial Intelligence. (1992)
3. Stephan, P., Brayton, R., Sangiovanni-Vencentelli, A.: Combinational test generation using satisfiability. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15 (1996) 1167-1176
4. Jackson, D., Vaziri, M.: Finding bugs with a constraint solver. In: International Symposium on Software Testing and Analysis, Portland, OR. (2000)
5. Velev, M.N., Bryant, R.E.: Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW. In: 38th DAC, New York, NY, USA, ACM Press (2001) 226-231
6. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic Model Checking without BDDs. In: Proc. of TACAS. (1999)
7. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of ACM 7(1960) 201-215
8. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Communications of the ACM 5 (1962) 394-397
9. Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Proceedings of the Second DIMACS Challange on Cliques, Coloring, and Satisfiability. (1993)
10. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35 (1962) 394-397
11. Gunnar Stålmarck: System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated from Boolean Formula (1994) United States Patent. Patent Number 5,276,897.
12. Gu, J., Purdom, P.W., Franco, J., Wah, B.W.: Algorithms for the Satisfiability (SAT) Problem: A Survey. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1997)
13. Nam, G.J., Sakallah, K.A., Rutenbar, R.A.: Satisfiability-Based Layout Revisited: Detailed Routing of Complex FPGAs Via Search-Based Boolean SAT. In: ACM/SIGDA International Symposium on FPGAs. (1999)
14. Marques-Silva, J.P., Sakallah, K.A.: Conflict Analysis in Search Algorithms for Propositional Satisfiability. In: IEEE International Conference on Tools with Artificial Intelligence. (1996)
15. Bayardo, R., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: National Conference on Artificial Intelligence (AAAI). (1997)
16. Zhang, H.: SATO: An efficient prepositional prover. In: International Conference on Automated Deduction. (1997)
17. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: 38th DAC. (2001)
18. Goldberg, E., Novikov, Y.: BerkMin: A Fast and Robust SAT Solver. In: DATE. (2002)
19. Siege Satisfiability Solver, http://www.cs.sfu.ca/~loryan/personal/ (2004).
20. SAT Competition 2003, http://www.satlive.org/SATCompetition/2003/ (2004).
21. SAT Competition 2004, http://www.satlive.org/SATCompetition/2004/ (2004).
22. http://www.cs.Washington.edu/homes/kautz/satplan/blackbox/ (2004).
23. NuSMW Home Page, http://nusmv.irst.itc.it/ (2004).
24. GrAnDe, http://www.cs.miami.edu/~tptp/ATPSystems/GrAnDe/ (2004).
25. SAT Competition 2002, http://www.satlive.org/SATCompetition/2002/ (2004).
26. Plaisted, D.A., Greenbaum, S.: A stucture-preserving clause form translation. Journal of Symbolic Computation 2 (1986) 293-304
27. Marques-Silva, J.P., Sakallah, K.A.: GRASP - A New Search Algorithm for Satisfiability. In: IEEE International Conf. on Tools with Artificial Intelligence. (1996)
28. Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD. (2001) 279-285
29. Li, C.M.: Integrating Equivalency reasoning into Davis-Putnam procedure. In: AAAI. (2000)
30. Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)
31. Marques-Silva, J.P.: The impact of branching heuristics in propositional satisfiability algorithms. In: 9th Portuguese Conf. on Artificial Intelligence. (1999)
32. Zhang, L.: Searching for Truth: Techniques for Satisfiability of Boolean Formulas. PhD thesis, Princeton University (2003)
33. Crawford, J., Auton, L.: Experimental results on the cross-over point in satisfiability problems. In: National Conf. on Artificial Intelligence (AAAI). (1993)
34. Zhang, H., Stickel, M.: An efficient algorithm for unit-propagation. In: Fourth International Symposium on Artificial Intelligence and Mathematics, Florida. (1996)
35. Nadel, A.: The Jerusat SAT Solver. Master's thesis, Hebrew University of Jerusalem (2002)
36. Pilarski, S., Hu, G.: Speeding up SAT for EDA. In: DATE. (2002)
37. Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies. In: The 18th National Conf. on Artificial Intelligence. (2002)
38. http://www2.inf.ethz.ch/personal/biere/projects/limmat/ (2004).