ArticlesStochastic Systematic Search Algorithms for Satisfiability☆
References (22)
- et al.
GSAT and dynamic backtracking
Proceedings of the International Conference on Principles of Knowledge and Reasoning
(1994) - et al.
Complete search restart strategies for satisfiability
IJCAI Workshop on Stochastic Search Algorithms (IJACI-SSA)
(August 2001) - et al.
Using randomization and learning to solve hard real-world instances of satisfiability
Proceedings of the International Conference on Principles and Practice of Constraint Programming
(2000) - et al.
Using CSP look-back techniques to solve real-world SAT instances
Proceedings of the National Conference on Artificial Intelligence
(1997) - et al.
A machine program for theorem-proving
Communications of the Association for Computing Machinery
(July 1962) - et al.
A computing procedure for quantification theory
Journal of the Association for Computing Machinery
(1960) Dynamic backtracking
Journal of Artificial Intelligence Research
(1993)- et al.
Boosting combinatorial search through randomization
Proceedings of the National Conference on Artificial Intelligence
(July 1998) - D.S. Johnson and M.A. Trick, editors. Second DIMACS Implementation Challenge. American Mathematical Society, 1993....
- et al.
Look-ahead versus look-back for satisfiability problems
Proceedings of International Conference on Principles and Practice of Constraint Programming
(1997)
There are more references available in the full text version of this article.
Cited by (4)
Partial backtracking in CDCL solvers
2013, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Survey on QBF evaluation algorithms
2011, Jisuanji Yanjiu yu Fazhan/Computer Research and DevelopmentApplication of backtracking algorithm in college dormitory assignment management
2009, Proceedings - 2009 2nd IEEE International Conference on Computer Science and Information Technology, ICCSIT 2009Local restarts
2008, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
Expanded version of a work presented in SAT 2001: Workshop on Theory and Applications of Satisfiability Testing (affiliated with LICS 2001).
- 1
This work is partially supported by FCT - Fundaç ão para a Ciě ncia e Tecnologia under research projects PRAXIS/P/EEI/11249/1998 and PCTI/CHS/34504/1999.
Copyright © 2004 Elsevier Ltd. All rights reserved.