1. Andersen, H.R., Hadžić, T., Hooker, J.N., & Tiedemann, P. (2007). A constraint store based on multivalued decision diagrams. In C. Bessiere (Ed.), Principles and practice of constraint programming (CP 2007). Lecture Notes in Computer Science, (Vol. 4741 pp. 118–132). Springer.
2. Appa, G., Magos, D., & Mourtos, I. (2004). Linear programming relaxations of multiple all-different predicates. In J.C. Régin, & M. Rueher (Eds.), CPAIOR 2004 Proceedings. Lecture Notes in Computer Science, (Vol. 3011 pp. 364–369). Springer.
3. Appa, G., Magos, D., & Mourtos, I. (2004). On the system of two all-different predicates. Information Processing Letters, 94, 99–105.
4. Beame, P., Kautz, H., & Sabharwal, A. (2003). Understanding the power of clause learning. In International Joint Conference on Artificial Intelligence (IJCAI 2003).
5. Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathematical and Computer Modelling, 12, 97–123.