Speedup techniques utilized in modern SAT solvers - An analysis in the MIRA environment

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 437-443

  Lewis, Matthew D T ^a   Schubert, Tobias ^a   Becker, Bernd W ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; OPTIMIZATION;

EARLY CONFLICT DETECTION BASED BCP (ECDB); IMPLICATION QUEUE SORTING (IQS); VARIABLE MOVE TO FRONT (VMTF); VARIABLE STATE INDEPENDENT DECAYING SUM (VSIDS);

PROBLEM SOLVING;

EID: 26444437792     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_36     Document Type: Conference Paper

References (21)

1. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik, "Chaff: Engineering an Efficient SAT Solver", Proceedings of the 38th DAC, July 2001.
2. E. Goldberg and Y. Novikov, "BerkMin: a Fast and Robust Sat-Solver", DATE 2002, Paris, France, March 2002, pp. 142-149.
3. R. Lawrence, "Efficient Algorithms for Clause-Learning SAT Solvers", Master's thesis, Simon Fraser University, February 2004.
4. M. Lewis, T. Schubert, and B. Becker, "Early Conflict Detection Based BCP for SAT Solving", SAT 2004, May 2004.
5. M. Davis, and H. Putnam, "A Computing Procedure for Quantification Theory", Journal of the ACM, Vol. 7, Number 3, pp. 201-215, July 1960.
6. M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem-Proving", Communications of the ACM, vol. 5, pp 394-397, 1962.
7. J. P. Marques-Silva,K. A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability", IEEE Transactions on Computers, Vol. 48, pp. 506-521, 1999.
8. Z. Fu, Y. Mahajan, S. Malik, "New Features of the SAT'04 Version of zChaff", SAT 2004 Competition: Solver Descriptions, May 2004.
9. A. Biere, "The Evolution from Limmat to Nanosat", Technical Report 444, Dept. of Computer Science, ETH Zürich, 2004.
10. A. Biere, Limmat Solver, http://www.inf.ethz.ch/personal/biere/projects/ limmat/
11. A. Van Gelder, "Generalizations of Watched Literals for Backtracking Search", 2001.
12. A. Nadel, "The Jerusat SAT Solver" Master's thesis, Hebrew University of Jerusalem, 2002.
13. I. Lynce, J. and Marques-Silva, "Efficient Data Structures for Fast SAT Solvers", 2001.
14. J. Alfredsson, "The SAT Solver Oepir", SAT 2004 Competition: Solver Descriptions, 2004.
15. Niklas Eén, Satzoo, http://www.cs.chalmers.se/~een/Satzoo/
16. N. Eén, and N. Sörensson, "An Extensible SAT-solver", SAT 2003, May 5-8 2003.
17. SAT2004, www.satlive.org
18. L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik, "Efficient Conflict Driven Learning in a Boolean Satisfiability Solver", ICCAD 2001.
19. H. Kautz, E. Horvitz, Y. Ruan, C. Gomes, and B. Selman, "Dynamic Restart Policies". The Eighteenth National Conference on Artificial Intelligence, 2002.
20. E.Goldberg, Y.Novikov, http://eigold.tripod.com/BerkMin.html
21. L. Zhang, and S. Malik, "Cache Performance of SAT Solvers: A Case Study for Efficient Implementation of Algorithms", SAT 2003, May 5-8 2003.