1. J. Gu, P. W. Purdom, J. Franco, and B. W. Wah. Algorithms for the satisfiability (sat) problem: A survey. In Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 19–153. AMS, 1997.
2. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and Easy Distributions for SAT Problems. In Proc. of AAAI, pages 459–465. AAAI Press, 1992.
3. J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5:77–87, 1983.
4. Bart Selman, Henry Kautz, and David McAllester. Ten Challenges in Propositional Reasoning and Search. In Proc. of IJCAI, pages 50–54. Morgan-Kauffmann, 1997.
5. Massacci and Marraro. Logical Cryptanalysis as a SAT Problem. JAR: Journal of Automated Reasoning, 24, 2000.