1. Achlioptas, D., Gomes, C., Kautz, H., Selman, B.: Generating satisfiable problem instances. In: Proceedings of the National Conference on Artificial Intelligence, pp. 256–261. Menlo Park, CA, Cambridge, MA, London, AAAI Press, MIT Press, 1999 (2000)
2. Ansótegui, C., Bonet, M.L., Levy, J.: Towards industrial-like random SAT instances. In: Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 387–392 (2009)
3. Ansótegui, C., Bonet, M.L., Levy, J., Manyà, F.: Measuring the hardness of SAT instances. In: Proceedings of the Twenty-Third National Conference on Artificial Intelligence (AAAI-08), pp. 222–229 (2008)
4. Lecture Notes in Computer Science;D Babić,2007
5. Babić, D., Hutter, F.: Spear theorem prover. Solver Description, SAT Race 2008 (2008)