F. Bacchus, X. Chen, P. Van-beek, and T. Walsh, Binary vs. non-binary constraints, Artificial Intelligence, vol.140, issue.1-2, pp.1-37, 2002.

C. Bessière, A. Chmeiss, and L. Saïs, Neighborhood-based variable ordering heuristics for the constraint satisfaction problem, Proceedings CP'01, pp.565-569, 2001.

C. Bessière, P. Meseguer, E. C. Freuder, and J. Larrosa, On forward checking for non-binary constraint satisfaction, Artificial Intelligence, vol.141, pp.205-224, 2002.

C. Bessière and J. C. Régin, MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems, Proceedings CP'96, pp.61-75, 1996.

C. Bessière and J. C. Régin, Refining the basic constraint propagation algorithm, Proceedings IJCAI'01, pp.309-315, 2001.

M. Davis, G. Logemann, and D. Loveland, A machine program for theorem proving, Communications of the ACM, vol.5, pp.394-397, 1962.

R. Debruyne, A property of path inverse consistency leading to an optimal PIC algorithm, Proceedings ECAI'00, pp.88-92, 2000.

R. Dechter and P. Van-beek, Local and global relational consistency, Theoretical Computer Science, vol.173, issue.1, pp.283-308, 1997.

E. C. Freuder, A sufficient condition for backtrack-bounded search, Journal of the ACM, vol.32, pp.755-761, 1985.

I. P. Gent, Arc consistency in SAT, Proceedings ECAI'02, 2002.

E. Golberg and Y. Novikov, Berkmin: a fast and robust sat-solver, Proceeding DATE'02, pp.142-149, 2002.

S. Kasif, On the parallel complexity of discrete relaxation in constraint satisfaction networks, Artificial Intelligence, vol.45, pp.275-286, 1990.

B. A. Nadel, Constraint satisfaction algorithms, Computational Intelligence, vol.5, pp.188-224, 1989.

P. Van-beek and R. Dechter, Constraint tightness and looseness versus local and global consistency, Journal of the ACM, vol.44, pp.549-566, 1997.

K. Peter-van-beek and . Wilken, Fast optimal instruction scheduling for singleissue processors with arbitrary latencies, Lecture Notes in Computer Science, vol.2239, pp.625-639, 2001.

G. Verfaillie, D. Martinez, and C. Bessière, A generic customizable framework for inverse local consistency, Proceeding AAAI'99, pp.169-174, 1999.

T. Walsh, SAT v CSP, Proceedings CP'00, pp.441-456, 2000.