1. Lecture Notes in Computer Science;A. Biere,2005
2. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of bdds. In: Proceedings of Design Automation Conference, DAC 1999 (1999)
3. Connamacher, H.: A random constraint satisfaction problem that seems hard for dpll. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542. Springer, Heidelberg (2005)
4. Tompkins, D.A.D., Hoos, H.H.: Ubcsat: An implementation and experimentation environment for sls algorithms for sat and max-sat, pp. 37–46 (2004)
5. Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-sat formulae. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), Seattle, Washington, USA, August 4th-10th (2001)