C. W. Choi, J. H. Lee, and P. J. Stuckey, Propagation Redundancy in Redundant Modelling, Proceedings of CP-2003, volume LNCS 2833, pp.229-243, 2003.
DOI : 10.1007/978-3-540-45193-8_16

R. Coletta, C. Bessiere, B. O-'sullivan, E. C. Freuder, S. O. Connell et al., Constraint acquisition as semi-automatic modeling, Proceedings of AI'03, pp.111-124, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00191968

R. Coletta, C. Bessiere, B. O-'sullivan, E. C. Freuder, S. O. Connell et al., Semiautomatic modeling by constraint acquisition, Proceedings of CP-2003, Short paper, pp.812-816, 2003.
DOI : 10.1007/978-3-540-45193-8_58

URL : https://hal.archives-ouvertes.fr/lirmm-00269537

A. Dechter and R. Dechter, Removing redundancies in constraint networks, Proceedings of AAAI-87, pp.105-109, 1987.

R. Dechter and P. Van-beek, Local and global relational consistency, Theoretical Computer Science, vol.173, issue.1, pp.283-308, 1997.
DOI : 10.1016/S0304-3975(97)86737-0

A. K. Mackworth, Consistency in networks of relations, Artificial Intelligence, vol.8, issue.1, pp.99-118, 1977.
DOI : 10.1016/0004-3702(77)90007-8

T. Mitchell, Generalization as search, Artificial Intelligence, vol.18, issue.2, pp.203-226, 1982.
DOI : 10.1016/0004-3702(82)90040-6

R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Ttroyansky, Determining computational complexity from characteristic 'phase transition, Nature, vol.400, pp.133-137, 1999.

B. M. Smith, Succeed-first or fail-first: A case study in variable and value ordering, 1996.