1. A. Aggoun and N. Beldiceanu. Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7):57–73, 1993.
2. P. Baptiste and C. Le Pape. A theoretical and experimental comparison of constraint propagation techniques for disjunctive scheduling. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI-95), Montreal, Canada, August 1995.
3. N. Beldiceanu and E. Contejean. Introducing global constraints in CHIP. Mathl. Comput. Modelling, 20(12):97–123, 1994.
4. B. Carlson and M. Carlsson. Compiling and Executing Disjunctions of Finite Domain Constraints. In Proceedings of the Twelfth International Conference on Logic Programming. MIT Press, 1995.
5. B. Carlson, M. Carlsson, and D. Diaz. Entailment of finite domain constraints. In Proceedings of the Eleventh International Conference on Logic Programming. MIT Press, 1994.