N. Beldiceanu, E. Bourreau, H. Simonis, and P. Chan. Partial search
strategy in CHIP. Presented at 2nd Metaheuristic International Conference
MIC97, Sophia-Antipolis, France, July 21–24, 1997.
 K. C. Cheng and R. H. Yap. Maintaining generalized arc consistency on
ad hoc n-ary constraints. In CP ’08: Proceedings of the 14th international
conference on Principles and Practice of Constraint Programming, pages
509–523, Berlin, Heidelberg, 2008. Springer-Verlag.
 COSYTEC. CHIP System Documentation, 1996.
 D. Diaz. GNU Prolog A Native Prolog Compiler with Constraint Solving
over Finite Domains, Edition 1.7, for GNU Prolog version 1.2.16, September
 C. Gervet. Interval propagation to reason about sets: Definition and
implementation of a practical language. An International Journal on Constraints,
 Warwick Harvey and Joachim Schimpf. Bounds consistency techniques for
long linear constraints. In In Proceedings of TRICS: Techniques foR Implementing
Constraint programming Systems, pages 39–46, 2002.
 W.D. Harvey and M.L. Ginsberg. Limited discrepancy search. In IJCAI-95,
Montreal, Canada, 1995.
 I. Katriel, M. Sellmann, E. Upfal, and P. Van Hentenryck. Propagating
knapsack constraints in sublinear time. In AAAI, pages 231–236, 2007.
 R.Baker Kearfott. Interval Newton methods. In Christodoulos A.
Floudas and Panos M. Pardalos, editors, Encyclopedia of Optimization, pages
1763–1766. Springer US, 2009.
 Ch. Lecoutre. Optimization of simple tabular reduction for table constraints.
In CP ’08: Proceedings of the 14th international conference on Principles and
Practice of Constraint Programming, pages 128–143, Berlin, Heidelberg, 2008.
 Yuri Malitsky, Meinolf Sellmann, and Radoslaw Szymanek. Filtering
bounded knapsack constraints in expected sublinear time. In AAAI Conference on
Artificial Intelligence, 2010.
 K. Marriott and P. J. Stuckey. Programming with Constraints: An
Introduction. The MIT Press, 1998.
 J. F. Puget. A fast algorithm for the bound consistency of alldiff constraints.
In Proceedings of the Fifteenth National Conference on Artiffcial Intelligence
(AAAI’98), pages 359–366. American Association for Artificial Intelligence,
 J-C. Régin. A filtering algorithm for constraint of difference in CSPs. In 12th
National Conference on Artificial Intelligence (AAAI-94), pages 362–367, Menlo
Park, California, USA, 1994.
 Rida Sadek, Emmanuel Poder, Mats Carlsson, Nicolas Beldiceanu, and
Charlotte Truchet. A generic geometrical constraint kernel in space and time for
handling polymorphic k-dimensional objects. In Proceedings of CP’2007: 13th
International Conference on Principles and Practice of Constraint Programming,
page 14, Providence, Rhode Island, USA, 2007. Lecture Notes in Computer
Science: Vol. 4741.
 Ch. Schulte and G. Smolka. Finite domain constraint programming in Oz. A
tutorial, 2001. version 1.2.1.
 Paul Shaw. A constraint for bin packing. In Mark Wallace, editor, Principles
and Practice of Constraint Programming - CP 2004, volume 3258 of Lecture
Notes in Computer Science, pages 648–662. Springer Berlin / Heidelberg, 2004.
 Swedish Institute of Computer Science. SICStus Prolog User’s Manual,
Version 3.11, June 2004.