S. Abdennadher, Operational semantics and confluence of constraint propagation rules, Proceedings of CP'1997, 3rd International Conference on Principles and Practice of Constraint Programming, pp.252-266, 1997.
DOI : 10.1007/BFb0017444

S. Abdennadher and T. W. Frühwirth, Integration and optimization of rule-based constraint solvers Logic Based Program Synthesis and Transformation . LOPSTR, Revised Selected Papers, Lecture Notes in Computer Science, 2003.

S. Abdennadher and H. Schütz, CHRv : A flexible query language, FQAS '98 : Proceedings of the Third International Conference on Flexible Query Answering Systems, pp.1-14, 1998.

H. Betz and T. W. Frühwirth, A linearlogic semantics for constraint handling rules, Proceeding of CP 2005, pp.137-151, 2005.

E. Coquery and F. Fages, A type system for CHR In Recent Advances in Constaints, revised selected papers from CS- CLP'05, number 3978 in Lecture Notes in Artificial Intelligence, pp.100-117, 2006.

B. Courcelle, Fundamental properties of infinite trees, Theoretical Computer Science, vol.25, issue.2, pp.95-169, 1983.
DOI : 10.1016/0304-3975(83)90059-2

G. Duck, M. Garcia-de-la-banda, and P. Stuckey, Compiling Ask Constraints, Proceedings of International Conference on Logic Programming ICLP 2004, 2004.
DOI : 10.1007/978-3-540-27775-0_8

G. J. Duck, P. J. Stuckey, C. Mar-`-mar-`-ia-garc-`-garc-`-ia-de-la-banda, and . Holzbaur, Extending arbitrary solvers with constraint handling rules, Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming , PPDP '03, pp.79-90
DOI : 10.1145/888251.888260
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.1198

F. Fages, P. Ruet, and S. Soliman, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, pp.14-41, 2001.
DOI : 10.1006/inco.2000.3002
URL : https://hal.archives-ouvertes.fr/hal-01431358

T. Frühwirth, Theory and practice of Constraint Handling Rules [11] Harald Ganzinger. A new metacomplexity theorem for bottom-up logic programs, Proceedings of International Joint Conference on Automated Reasoning, pp.95-138, 1998.

J. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

K. P. Girish and J. John, Relations and functions in multiset context, Information Sciences, vol.179, issue.6, pp.758-768, 2009.
DOI : 10.1016/j.ins.2008.11.002

R. Haemmerlé and F. Fages, Modules for Prolog Revisited, Proceedings of International Conference on Logic Programming ICLP 2006, number 4079 in Lecture Notes in Computer Science, pp.41-55, 2006.
DOI : 10.1007/11799573_6

P. Van-hentenryck, V. A. Saraswat, and Y. Deville, Design, implementation, and evaluation of the constraint language cc(FD), The Journal of Logic Programming, vol.37, issue.1-3, pp.139-164, 1998.
DOI : 10.1016/S0743-1066(98)10006-7

A. Vijay and . Saraswat, Concurrent constraint programming ACM Doctoral Dissertation Awards, 1993.

T. Schrijvers, B. Demoen, G. Duck, P. Stuckey, and T. Fruhwirth, Automatic Implication Checking for CHR Constraints, Electronic Notes in Theoretical Computer Science, vol.147, issue.1, pp.93-111, 2006.
DOI : 10.1016/j.entcs.2005.06.039

T. Schrijvers and T. W. Frühwirth, Analysing the CHR implementation of unionfind, Proceedings of the 19th Workshop on (Constraint) Logic Programming, WCLP'05, 2005.

R. Endre-tarjan and J. Van-leeuwen, Worst-case Analysis of Set Union Algorithms, Journal of the ACM, vol.31, issue.2, pp.245-281, 1984.
DOI : 10.1145/62.2160