R. Debruyne and C. Bessì-ere, Some Practicable Filtering Techniques for the Constraint Satisfaction Problem, Proc. IJCAI, pp.412-417, 1997.

P. A. Geelen, Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems, Proc. ECAI'92, pp.31-35, 1992.

L. Granvilliers and F. Benhamou, RealPaver : An Interval Solver using Constraint Satisfaction Techniques, ACM Trans. on Mathematical Software, vol.32, issue.1, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00480813

C. Lecoutre and S. Cardon, A Greedy Approach to Establish Singleton Arc Consistency, Proc. of IJCAI'05, pp.199-204, 2005.

O. Lhomme, Consistency Tech. for Numeric CSPs, IJCAI, pp.232-238, 1993.

O. Lhomme, Quick Shaving, Proc. AAAI, pp.411-415, 2005.

C. , M. Li, and A. , Heuristics Based on Unit Propagation for Satisfiability Problems, Proc. IJCAI, pp.366-371, 1997.

A. Neumaier, Interval Methods for Systems of Equations, 1990.
DOI : 10.1017/CBO9780511526473

B. Neveu, G. Chabert, and G. Trombettoni, When Interval Analysis helps Interblock Backtracking, Proc. CP'06, pp.390-405, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00486724

W. Page and C. , www-sop.inria.fr/coprin

P. Refalo, Impact-Based Search Strategies for Constraint Programming, Proc. CP'04, pp.557-571, 2004.
DOI : 10.1007/978-3-540-30201-8_41

J. C. Régin, A Filtering Algorithm for Constraints of Difference in CSPs, Proc. AAAI, pp.362-367, 1994.

H. Simonis, Sudoku as a Constraint Problem, CP Workshop on Modeling and Reformulating Constraint Satisfaction Problems, pp.13-27, 2005.

G. Trombettoni and G. Chabert, Constructive Interval Disjunction, CP Workshop IntCP, 2006.
DOI : 10.1007/978-3-540-74970-7_45

URL : https://hal.archives-ouvertes.fr/hal-00936654

P. Van-hentenryck, L. Michel, and Y. Deville, Numerica : A Modeling Language for Global Optimization, 1997.

P. Van-hentenryck, V. Saraswat, and Y. Deville, Design, implementation, and evaluation of the constraint language cc(FD), The Journal of Logic Programming, vol.37, issue.1-3, pp.1-3139, 1994.
DOI : 10.1016/S0743-1066(98)10006-7