1. Abdennadher, S., & Rigotti, C. (2005). Automatic generation of CHR constraint solvers. Theory and Practice of Logic Programming, 5(4), 403–418.
2. Beldiceanu, N., Carlsson, M., Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In M.G. Wallace (Ed.), CP 2004. LNCS (Vol. 3258, pp. 107–122). Springer.
3. Beldiceanu, N., Carlsson, M., Petit, T., Régin, J.C. (2012). An O(nlogn) bound consistency algorithm for the conjunction of an alldifferent and an inequality between a sum of variables and a constant, and its generalization. In L.D. Raedt, C. Bessière, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, P.J.F. Lucas (Eds.), ECAI 2012 (pp. 145–150). IOS Press.
4. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In C. Bessière (Ed.), CP 2007. LNCS (Vol. 4741, pp. 180–194). Springer.
5. Beldiceanu, N., Carlsson, M., Rampon, J.X. (2012). Global constraint catalog 2nd edn. (revision a). Tech. Rep. T2012:03, Swedish Institute of Computer Science. Available at http://soda.swedish-ict.se/5195 .