The effect of restarts on the efficiency of clause learning

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2318-2323

  Huang, Jinbo ^a  

^a CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARBITRARY POINTS; BACKTRACKING SEARCH; CLAUSE LEARNING; COMBINATORIAL SEARCH; ITS EFFICIENCIES; RESTART POLICY; SAT SOLVERS; SATISFYING ASSIGNMENTS;

ARTIFICIAL INTELLIGENCE; EFFICIENCY; FORMAL LOGIC;

DECISION THEORY;

EID: 84880868376     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Paul Beame, Henry A. Kautz, and Ashish Sabharwal. Towards understanding and harnessing the potential of clause learning. Journal of Artificial Intelligence Research, 22:319-351, 2004.
2. Daniel Le Berre and Laurent Simon. The Annual SAT Competitions. http://www.satcompetition.org/, 2005.
3. Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Journal of the ACM, (5)7:394-397, 1962.
4. Niklas Eén and Niklas Sörensson. MiniSat - A SAT solver with conflict-clause minimization. In SAT 2005 Competition, 2005.
5. Eugene Goldberg and Yakov Novikov. BerkMin: A fast and robust SAT-solver. In Design Automation and Test in Europe (DATE), pages 142-149, 2002.
6. Carla P. Gomes, Bart Selman, and Nuno Crato. Heavy-tailed distributions in combinatorial search. In Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP), pages 121-135, 1997.
7. Carla P. Gomes, Bart Selman, and Henry A. Kautz. Boosting combinatorial search through randomization. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI), pages 431-437, 1998.
8. Henry A. Kautz, Eric Horvitz, Yongshao Ruan, Carla P. Gomes, and Bart Selman. Dynamic restart policies. In Proceedings of the 18th National Conference on Artificial Intelligence (AAAI), pages 674-681, 2002.
9. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI), pages 366-371, 1997.
10. Michael Luby, Alistair Sinclair, and David Zuckerman. Optimal speedup of Las Vegas algorithms. Information Processing Letters, 47(4):173-180, 1993.
11. Inês Lynce and João P. Marques Silva. Complete unrestricted backtracking algorithms for satisfiability. In Fifth International Symposium on Theory and Applications of Satisfiability Testing (SAT), 2002.
12. Joao Marques-Silva and Karem Sakallah. GRASP - A new search algorithm for satisfiability. In Proceedings of the International Conference on Computer Aided Design (ICCAD), pages 220-227, 1996.
13. Matthew Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC), pages 530-535, 2001.
14. Lawrence Ryan. Efficient algorithms for clause-learning SAT solvers. Master's thesis, Simon Fraser University, School of Computing Science, 2004.
15. Toby Walsh. Search in a small world. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI), pages 1172-1177, 1999.
16. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik. Efficient conflict driven learning in a Boolean satisfiability solver. In Proceedings of the International Conference on Computer Aided Design (ICCAD), pages 279-285, 2001.
17. Lintao Zhang. On subsumption removal and on-the-fly CNF simplification. In Proceedings of the Eighth International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 482-489, 2005.