A clause-based heuristic for SAT solvers

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 46-60

  Dershowitz, Nachum ^a   Hanna, Ziyad ^b   Nadel, Alexander ^a,b  

^a TEL AVIV UNIVERSITY   (Israel)

^b INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTATIONAL METHODS; PROBLEM SOLVING;

DECISION VARIABLES; SATISFIABILITY SOLVERS; ZCHAFF SOLVERS;

COMPUTER SCIENCE;

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

References (18)

1. J. Alfredsson. The SAT solver Oepir. URL http://www.lri.fr/~simon/ contest/results/ONLINEBOOKLET/OepirA.ps (viewed January, 16 2005).
2. R. Bayardo, Jr., and R. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the National Conference on Artificial Intelligence, pp. 203-208, 1997.
3. M. Davis, G. Logemann and D. Loveland. A machine program for theorem proving. In Communications of the ACM, (5): 394-397, 1962.
4. N. Eén and N. Sörensson. An extensible SAT-solver. In Proceedings of Sixth International Conference on Theory and Applications of Satisfiability Testing (SAT2003), May 2003.
5. E. Goldberg and Y. Novikov. BerkMin: A fast and robust SAT-solver. In Design, Automation, and Test in Europe (DATE '02), p. 142-149, March 2002.
6. C.P. Gomes, B. Selman and H. Kautz. Boosting combinatorial search through randomization. In Proceedings of the National Conference on Artificial Intelligence, July 1998.
7. R.G. Jeroslaw and J. Wang. Solving prepositional satisfiability problems. In Annals of mathematics and Artificial Intelligence, (1):167-187, 1990.
8. H. Kautz, B. Selman. Planning as satisfiability. In Proceedings of the 10th European conference on Artificial intelligence, 1992.
9. D. Le Berre and L. Simon. Fifty-five solvers in Vancouver: The SAT 2004 competition. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), volume Lecture Notes in Computer Science, 2004. Accepted for publication.
10. Y.S. Mahajan, Z. Fu, S. Malik. ZChaff2004: an efficient SAT solver. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), volume Lecture Notes in Computer Science, 2004. Accepted for publication.
11. J.P. Marques-Silva. The impact of branching heuristics in prepositional satisfiability algorithms. In Proceedings of the 9th Portuguese Conference on Artificial Intelligence (EPIA), September 1999.
12. J.P. Marques-Silva and K. A. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEE Transactions on Computers, (48):506-521, 1999.
13. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the Design Automation Conference, 2001.
14. M. R. Prasad, A. Biere, A. Gupta. A survey of recent advances in SAT-based formal verification, Intl. Journal on Software Tools for Technology Transfer (STTT), (7):156-173, January 2005.
15. L. Ryan, Efficient algorithms for clause-learning SAT solvers. Masters thesis, Simon Fraser University, February 2004.
16. Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT2004), May 2004. URL http://satlive.org/ SATCompetition/2004/- (viewed September 1, 2004).
17. R. Zabih and D.A. McAllester. A rearrangement search strategy for determining propositional satisfiability. In Proceedings of National Conference on Artificial Intelligence, p. 155-160, 1988.
18. L. Zhang, C.F. Madigan, M.H. Moskewicz and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. International Conference on Computer-Aided Design (ICCAD'01), p. 279-285, November 2001.