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, T. W. Frühwirth, and H. Meuss, Confluence and semantics of constraint simplification rules, Constraints, vol.4, issue.2, pp.133-165, 1999.
DOI : 10.1023/A:1009842826135

S. Abdennadher and M. Marte, University course timetabling using constraint handling rules, Applied Artificial Intelligence, vol.14, issue.4, 2000.
DOI : 10.1080/088395100117016

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.

C. Schürmann and A. Schack-nielsen, Invited talk: The CHR-Celf connection, Proceedings of the fifth Constraint Handling Rules Workshop CHR'08, 2008.

J. Andreoli, Logic Programming with Focusing Proofs in Linear Logic, Journal of Logic and Computation, vol.2, issue.3, 1992.
DOI : 10.1093/logcom/2.3.297

R. Backofen and S. Will, Excluding Symmetries in Constraint-Based Search, Lecture Notes in Computer Science, vol.1713, pp.73-87, 1999.
DOI : 10.1007/978-3-540-48085-3_6

G. Berry and G. Boudol, The chemical abstract machine, Theoretical Computer Science, vol.96, 1992.
URL : https://hal.archives-ouvertes.fr/inria-00075426

E. Best, F. S. De-boer, and C. Palamidessi, Concurrent constraint programming with information removal, Proceedings of Coordination, Lecture Notes in Computer Science, 1997.

H. Betz, Relating coloured petri nets to constraint handling rules, Proceedings of the forth Constraint Handling Rules Workshop CHR'07, pp.33-47, 2007.

H. Betz and T. W. Frühwirth, A Linear-Logic Semantics for Constraint Handling Rules, Proceeding of CP 2005, pp.137-151, 2005.
DOI : 10.1007/11564751_13

H. Betz, F. Raiser, and T. Frühwirth, A complete and terminating execution model for Constraint Handling Rules. Theory and Practice of Logic Programming, pp.4-6597, 2010.

K. H. Borgwardt, The average number of pivot steps required by the simplexmethod is polynomial, Mathematical Methods of Operations Research, 1982.

M. Bruynooghe, M. Codish, J. P. Gallagher, S. Genaim, and W. Vanhoof, Termination analysis of logic programs through combination of type-based norms, ACM Transactions on Programming Languages and Systems, vol.29, issue.2, 2007.
DOI : 10.1145/1216374.1216378

A. Colmerauer, H. Kanoui, R. Pasero, and P. Roussel, Un système de communication en français, rapport préliminaire de fin de contrat iria, groupe intelligence artificielle, 1972.

E. Coquery and F. Fages, From typing constraints to typed constraint systems in CHR, Proceedings of Third workshop on Rulebased Constraint Reasoning and Programming, 2001.

E. Coquery and F. Fages, A type system for CHR In Recent Advances in Constaints, revised selected papers from CSCLP'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

L. De and K. , Logical algorithms meets CHR: A meta-complexity theorem for Constraint Handling Rules with rule priorities, Theory and Practice of Logic Programming, 2009.

L. De-koninck, T. Schrijvers, and B. Demoen, User-definable rule priorities for CHR, Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming, PPDP '07, pp.25-36, 2007.
DOI : 10.1145/1273920.1273924

E. W. Dijkstra, Hierarchical ordering of sequential processes, Acta Informatica, vol.1, issue.2, pp.115-138, 1971.
DOI : 10.1007/BF00289519

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, M. Garcia-de, L. Banda, and C. Holzbaur, The Refined Operational Semantics of Constraint Handling Rules, 20th International Conference on Logic Programming (ICLP'04, pp.90-104, 2004.
DOI : 10.1007/978-3-540-27775-0_7

G. J. Duck, P. J. Stuckey, M. Garcìa-de-la-banda, and C. 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, 2003.
DOI : 10.1145/888251.888260

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

A. M. Frisch, W. Harvey, C. Jefferson, B. Martinez-hernandez, and I. Miguel, Essence: A constraint language for specifying combinatorial problems, Constraints, vol.12, issue.1, pp.268-306, 2008.
DOI : 10.1007/s10601-008-9047-y

T. Frühwirth, Theory and practice of constraint handling rules, The Journal of Logic Programming, vol.37, issue.1-3, pp.95-138, 1998.
DOI : 10.1016/S0743-1066(98)10005-5

W. Thom and . Frühwirth, Constraint Handling Rules, 2009.

H. Ganzinger, A New Meta-Complexity Theorem for Bottom-Up Logic Programs, Proceedings of International Joint Conference on Automated Reasoning, pp.514-528, 2001.
DOI : 10.1007/3-540-45744-5_44

P. Ian, B. Gent, and . Smith, Symmetry breaking during search in constraint programming, Proceedings ECAI'2000, pp.599-603, 1999.

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

C. Giusto, M. Gabbrielli, and M. C. Meo, Expressiveness of Multiple Heads in CHR, SOFSEM '09: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science, pp.205-216, 2009.
DOI : 10.1016/j.tcs.2007.09.001

R. Haemmerlé, Fermetures et Modules dans les Langages Concurrents avec Contraintes fondés sur la Logique Linéaire, 2007.

R. Haemmerlé and H. Betz, Verification of constraint handling rules using linear logic phase semantics, Proceeding of CHR 2008, the fifth Constraint Handling Rules Workshop, 2008.

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

R. Haemmerlé, F. Fages, and S. Soliman, Closures and Modules Within Linear Logic Concurrent Constraint Programming, Proceedings of FSTTCS 2007, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pp.544-556, 2007.
DOI : 10.1007/978-3-540-77050-3_45

D. William, M. L. Harvey, and . Ginsberg, Limited discrepancy search, IJCAI'95: Proceedings of the 14th international joint conference on Artificial intelligence, pp.607-613, 1995.

P. Van, H. , and J. Carillon, Generality versus specificity: An experience with ai and or techniques, AAAI, pp.660-664, 1988.

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

J. Jaffar, M. Maher, K. Marriott, and P. Stuckey, The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1, The Journal of Logic Programming, vol.37, issue.1-3, pp.1-46, 1998.
DOI : 10.1016/S0743-1066(98)10002-X

J. Jaffar and J. Lassez, Constraint logic programming, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.111-119, 1987.
DOI : 10.1145/41625.41635

R. Jagadeesan, V. Shanbhogue, and V. A. Saraswat, Angelic nondeterminism in concurrent constraint programming, 1991.

T. Johnsson, Lambda lifting: Transforming programs to recursive equations, Proc. of a conference on Functional programming languages and computer architecture, pp.190-203, 1985.
DOI : 10.1007/3-540-15975-4_37

R. E. Korf, Optimal rectangle packing, ICAPS, pp.287-295, 2003.
DOI : 10.1007/s10479-008-0463-6

R. Kowalski, Predicate logic as programming language, IFIP Congress, pp.569-574, 1974.

J. Laurière, A language and a program for stating and solving combinatorial problems, Artificial Intelligence, vol.10, issue.1, pp.29-127, 1978.
DOI : 10.1016/0004-3702(78)90029-2

R. J. Lipton, The reachability problem requires exponential space, 1976.

J. Michael and . Maher, Logic semantics for a class of committed-choice programs, 4th International Conference on Logic Programming (ICLP'87, 1987.

E. W. Mayr, An algorithm for the general petri net reachability problem, Proceedings of the thirteenth annual ACM symposium on Theory of computing, STOC '81, pp.238-246, 1981.

D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov, Uniform proofs as a foundation for logic programming, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.125-157, 1991.
DOI : 10.1016/0168-0072(91)90068-W

N. Nethercote, P. J. Stuckey, R. Becket, S. Brand, G. J. Duck et al., MiniZinc: Towards a Standard CP Modelling Language, CP, pp.529-543, 2007.
DOI : 10.1007/978-3-540-74970-7_38

O. Ohrimenko, P. J. Stuckey, and M. Codish, Propagation via lazy clause generation, Constraints, vol.37, issue.1???3, pp.357-391, 2009.
DOI : 10.1007/s10601-008-9064-x

H. Otzbeyer and E. Pretschner, Testing concurrent reactive systems with constraint logic programming, Proc. 2nd workshop on Rule-Based Constraint Reasoning and Programming, 2000.

G. Pesant, A Regular Language Membership Constraint for Finite Sequences of Variables, Principles and Practice of Constraint Programming ? CP 2004, pp.482-495, 2004.
DOI : 10.1007/978-3-540-30201-8_36

G. Plotkin, Call-by-name, call-by-value and the ??-calculus, Theoretical Computer Science, vol.1, issue.2, pp.125-159, 1975.
DOI : 10.1016/0304-3975(75)90017-1

R. Rafeh, K. Marriott, M. Garcia-de-la-banda, N. Nethercote, and M. Wallace, Adding Search to Zinc, CP, pp.624-629, 2008.
DOI : 10.1007/978-3-540-85958-1_54

D. Sangiorgi, On the bisimulation proof method, Mathematical Structures in Computer Science, vol.8, issue.5, pp.447-479, 1998.
DOI : 10.1017/S0960129598002527

V. Saraswat, A brief introduction to linear concurrent constraint programming, Xerox PARC, 1993.

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

A. Schack-nielsen and C. Schürmann, Celf ??? A Logical Framework for Deductive and Concurrent Systems (System Description), IJCAR '08: Proceedings of the 4th international joint conference on Automated Reasoning, pp.320-326, 2008.
DOI : 10.1007/978-3-540-71070-7_28

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.

T. Schrijvers, P. Stuckey, and P. Wadler, Monadic constraint programming, Journal of Functional Programming, vol.19, issue.06, p.663, 2009.
DOI : 10.1145/359496.359529

T. Schrijvers, P. J. Stuckey, and G. J. Duck, Abstract interpretation for constraint handling rules, Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '05, pp.218-229, 2005.
DOI : 10.1145/1069774.1069795

H. Simonis, O. Barry, and . Sullivan, Search Strategies for Rectangle Packing, Proceedings of CP'08, pp.52-66, 2008.
DOI : 10.1007/978-3-540-85958-1_4

J. Sneyers, W. Meert, J. Vennekens, Y. Kameya, and T. Sato, CHR(PRISM)-based probabilistic logic learning. Theory and Practice of Logic Programming, pp.4-6433, 2010.

J. Sneyers, T. Schrijvers, and B. Demoen, The computational power and complexity of constraint handling rules, Proceedings of the second Constraint Handling Rules Workshop, at ICLP'05, pp.3-17, 2005.
DOI : 10.1145/1462166.1462169

J. Sneyers, T. Schrijvers, and B. Demoen, The computational power and complexity of constraint handling rules, ACM Transactions on Programming Languages and Systems, vol.31, issue.2, pp.311-353, 2009.
DOI : 10.1145/1462166.1462169

J. Sneyers, P. Var-weert, T. Schrijvers, and L. D. Koninck, As time goes by: Constraint Handling Rules ? a survey of CHR research between, Theory and Practice of Logic Programming, 1998.

M. Sulzmann, J. Wazny, and P. J. Stuckey, A Framework for Extended Algebraic Data Types, Proc. of FLOPS'06, pp.47-64, 2006.
DOI : 10.1007/11737414_5

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

P. Van and H. , The OPL Optimization programming Language, 1999.

L. David and . Waltz, Generating semantic descriptions from drawings of scenes with shadows, Massachusetts Institute of Technology, 1972.

]. D. Warren, An abstract Prolog instruction set, Technical Note, vol.309, 1983.

D. S. Warren, The Andorra principle, Presented at the Gigalips Workshop , Swedish Institute of Computer Science (SICS), 1988.