1. Sixth International Conference on Theory and Applications of Satisfiability Testing, S. Margherita Ligure - Portofino ( Italy) (May 2003)
2. Alexander, N.: Backtrack search algorithms for propositional satisfiability: Review and innovations. Master’s thesis, Hebrew University of Jerusalem (November 2002)
3. Audemard, G., Le Berre, D., Roussel, O., Lynce, I., Marques Silva, J.P.: Open- SAT: An Open Source SAT Software Project. In: Proc. of SAT 2003 [1] (2003)
4. Dequen, G., Dubois, O.: Renormalization as a function of clause lengths for solving random k-sat formulae. In: Proceedings of Fifth International Symposium on Theory and Applications of Satisfiability Testing, pp. 130–132 (2002)
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 4-10 (2001)