1. Achlioptas, D., Gomes, C. P., Kautz, H. A., & Selman, B. (2000). Generating satisfiable problem instances. In Proceedings of the seventeenth national conference on artificial intelligence (pp. 256–261).
2. Baptista, L., & Silva, J. P. M. (2000). Using randomization and learning to solve hard real-world instances of satisfiability. In Principles and practice of constraint programming (pp. 489–494).
3. Beck, J. C. (1999). Texture measurements as a basis for heuristic commitment techniques in constraint-directed scheduling. PhD thesis, University of Toronto.
4. Beck, J. C. (2005). Multi-point constructive search. In Proceedings of the eleventh international conference on principles and practice of constraint programming (CP’05) (pp. 737–741).
5. Beck, J. C. (2005). Multi-point constructive search: Extended remix. In Proceedings of the CP2005 workshop on local search techniques for constraint satisfaction (pp. 17–31).