1. Beldiceanu, N. (2001). Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. In T. Walsh (Ed.), Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming (CP-01), Paphos, Cyprus. Lecture Notes in Computer Science, volume 2239, pages 211–224. Berlin Heidelberg New York: Springer.
2. Beldiceanu, N., Carlsson, M., & Thiel, S. (2002). Cost-filtering Algorithms for the Two Sides of the Sum of Weights of Distinct Values Constraint. SICS Tech. Rep. T2002-14.
3. Bessiere, C., Hebrard, E., Hnich, B., & Walsh, T. (2004). Tractability of global constraints. In M. Wallace (Ed.), Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP-04),Toronto, Canada. Lecture Notes in Computer Science, volume 3258 pages 716–720. Berlin Heideleberg New York: Springer.
4. Debruyne, R., & Bessière, C. (1997). Some Practicable Filtering Techniques for the Constraint Satisfaction Problem. In M.E. Pollack (Ed.), Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), Nagoya, Japan. pages 412–417. San Mateo, California: Morgan Kaufmann.
5. Dincbas, M., van Hentenryck, P., Simonis, H., & Aggoun, A. (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems, Tokyo, Japan, (pp. 693–702). Tokyo, Japan: ICOT.