1. Barták, R., Rudová, H.: Limited assignments: A new cutoff strategy for incomplete depth-firstsearch. In: Haddad, H., Liebrock, L.M., Omicini, A., Wainwright, R.L. (eds.) SAC, pp. 388–392. ACM (2005)
2. Beck, J.C., Prosser, P., Wallace, R.J.: Toward understanding variable ordering heuristics for constraint satisfaction problems. In: Fourteenth Irish Artificial Intelligence and Cognitive Science Conference (AICS), pp. 11–16 (2003)
3. Bessière, C., Zanuttini, B., Fernandez, C.: Measuring search trees. In: Proceedings ECAI 2004 Workshop on Modelling and Solving Problems with Constraints, pp. 31–40. IOS Press (2004)
4. Borrett, J.E., Tsang, E.P.K., Walsh, N.R.: Adaptive constraint satisfaction: The quickest first principle. In: Wahlster, W. (ed.) ECAI, pp. 160–164. John Wiley and Sons, Chichester (1996)
5. Lecture Notes in Artificial Intelligence;C. Castro,2005