1. Baptista, L. and Marques-Silva, J. P.: Using randomization and learning to solve real-world instances of satisfiablility, in R. Dechter (ed.), Proceedings of the International Conference of Principles and Practice of Constraint Programming, Vol. 1894 of Lecture Notes in Computer Science, 2000, pp. 489–494.
2. Bayardo Jr., R. and Scharg, R.: Using CSP look-back techniques to solve real-world SAT instances, in Proceedings of the National Conference on Artificial Intelligence, 1997, pp.203–208.
3. Bhalla, A., Lynce, I., de Sousa, J. and Marques-Silva, J.: Heuristic backtracking algorithms for SAT, in Proceedings of the International Workshop of Microprocessor Test and Verification, 2003, pp. 69–74.
4. Bhalla, A., Lynce, J., de Sousa, J. and Marques-Silva, J. P.: Heuristic-based backtracking for propositional satisfiability, in F. Moura-Pires and S. Abreu (eds.), Proceedings of the Portuguese Conference on Artificial Intelligence, Vol., 1894 of Lecture Notes in Artificial Intelligence, 2003, pp. 116–130.
5. Davis, M., Logemann, G. and Loveland, D.: A machine program for theorem proving, Commun. Assoc. Comput. Mach. 5 (1962), 394–397.