B. Aspvall, Recognizing disguised NR(1) instances of the satisfiability problem, Journal of Algorithms, vol.1, issue.1, pp.97-103, 1980.
DOI : 10.1016/0196-6774(80)90007-3

B. Beckert, R. Hähnle, and F. Manyà, Transformations between signed and classical clause logic [3] Christian Bessiere. Constraint propagation, Proc. 29th IEEE International Symposium on Multiple-Valued Logic (ISMVL'99) Handbook of Constraint Programming, pp.248-255, 1999.
DOI : 10.1109/ismvl.1999.779724
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.5605

R. Dechter and J. Pearl, Structure identification in relational data, Artificial Intelligence, vol.58, issue.1-3, pp.237-270, 1992.
DOI : 10.1016/0004-3702(92)90009-M

Y. Deville, O. Barette, and P. Van-hentenryck, Constraint satisfaction over connected row-convex constraints, Artificial Intelligence, vol.109, issue.1-2, pp.243-271, 1999.
DOI : 10.1016/S0004-3702(99)00012-0
URL : http://doi.org/10.1016/s0004-3702(99)00012-0

J. Martin, D. A. Green, and . Cohen, Domain permutation reduction for constraint satisfaction problems, Artificial Intelligence, vol.172, pp.1094-1118, 2008.

J. Hébrard, A linear algorithm for renaming a set of clauses as a Horn set, Theoretical Computer Science, vol.124, issue.2, pp.343-350, 1994.
DOI : 10.1016/0304-3975(94)90015-9

P. Jeavons, D. Cohen, and M. C. Cooper, Constraints, consistency and closure, Artificial Intelligence, vol.101, issue.1-2, pp.251-265, 1998.
DOI : 10.1016/S0004-3702(98)00022-8

G. Peter, M. C. Jeavons, and . Cooper, Tractable constraints on ordered domains, Artificial Intelligence, vol.79, pp.327-339, 1995.

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

T. J. Schaefer, The complexity of satisfiability problems, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.216-226, 1978.
DOI : 10.1145/800133.804350

C. Schulte and P. J. Stuckey, When do bounds and domain propagation lead to the same search space, Proc. 3rd International Conference on Principles and Practice of Declarative Programming (PPDP'01), pp.115-126, 2001.

P. Van-beek and R. Dechter, On the minimality and global consistency of row-convex constraint networks, Journal of the ACM, vol.42, issue.3, pp.543-561, 1995.
DOI : 10.1145/210346.210347

P. Van-hentenryck, Y. Deville, and C. Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

G. J. Woeginger, An efficient algorithm for a class of constraint satisfaction problems, Operations Research Letters, vol.30, issue.1, pp.9-16, 2002.
DOI : 10.1016/S0167-6377(01)00114-6

B. Zanuttini and J. Hébrard, A unified framework for structure identification, Information Processing Letters, vol.81, issue.6, pp.335-339, 2002.
DOI : 10.1016/S0020-0190(01)00247-2
URL : https://hal.archives-ouvertes.fr/hal-00995240