1. Lecture Notes in Computer Science;B Crawford,2011
2. Lecture Notes in Computer Science;B Crawford,2011
3. Barták, R., Rudová, H.: Limited assignments: a new cutoff strategy for incomplete depth-firstsearch. In: Proceedings of the 20th ACM Symposium on Applied Computing (SAC), pp. 388–392 (2005)
4. Crawford, B., Castro, C., Monfroy, E., Soto, R., Palma, W., Paredes, F.: Dynamic selection of enumeration strategies for solving constraint satisfaction problems. Rom. J. Inf. Sci. Tech. 15(2), 106–128 (2012)
5. Crawford, B., Soto, R., Castro, C., Monfroy, E., Paredes, F.: An extensible autonomous search framework for constraint programming. Int. J. Phys. Sci. 6(14), 3369–3376 (2011)