A. Balafrej, C. Bessiere, E. Bouyakhf, and G. Trombettoni, Adaptive Singleton-Based Consistencies, AAAI 14, pp.2601-2607, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01067213

H. Bennaceur, A. , M. Bessì-ere, C. Régin, J. Yap et al., Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency, CP 01, vol.165, pp.165-185, 2001.

R. Debruyne and C. Ere, Some Practicable Filtering Techniques for the Constraint Satisfaction Problem, IJCAI 97, pp.412-417, 1997.

R. M. Haralick, E. , and G. L. , Increasing Tree Search Efficiency for Constraint Satisfaction Problems, Artificial Intelligence, vol.14, pp.263-313, 1980.

J. D. Horton, A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph, SIAM J. on Computing, vol.16, issue.2, pp.358-366, 1987.

F. Rossi, C. Petrie, and V. Dhar, On the Equivalence of Constraint Satisfaction Problems, ECAI 90, pp.550-556, 1990.

R. J. Wallace, SAC and Neighbourhood SAC, AI Communications, vol.28, issue.2, pp.345-364, 2015.

R. J. Woodward, B. Y. Choueiry, and C. Bessiere,

, Cycle-Based Singleton Local Consistencies