. 'extractconstraintsonvar-ye, 1000=?365*Ye+30*Me+1*De.nil,1*Me!=?12 V 1*De<?6.nil,nil] 5.4. Implantation 'Elimination of variable Ye': CSP[Me in?ArcConsistencyon constraint 1000=?30*Me+l*De+730': CSP[De in?

'. De, 1000=?30*Me+l*De+730.nil,1*Me!=?12 V 1*De<?6.nil,nil] 'Elimination of variable De': CSP[Me in?, De=30.Ne=1000.Ye=2.nil

K. R. Apt, A Pro of Theoretic View of Constraint Programming, Fundamenta Informaticae, vol.34, issue.3, pp.295-321, 1998.

H. Beringer and B. Debacker, Combinatorial Problem Solving in Constraint Logic Programming with Cooperative Solvers, Logic Programming: Formal Methods and Practical Applications, 1995.

C. Bessière, A fast algorithm to establish arc-consistency in constraint networks, 1994.

C. Bessière, Arc-consistency and arc-consistency again, Artificial Intelligence, vol.65, issue.1, pp.179-190, 1994.
DOI : 10.1016/0004-3702(94)90041-8

C. Bessière and J. Régin, An arc-consistency algorithm optimal in the number of constraint checks, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94, pp.9-16, 1994.
DOI : 10.1109/TAI.1994.346465

J. J. Bitner and E. M. Reingold, Backtrack programming techniques, Communications of the ACM, vol.18, issue.11, pp.651-656, 1975.
DOI : 10.1145/361219.361224

A. Bockmayr and T. Kasper, A unifying framework for integer and finite domain constraint programming. Research Report MPI-I-97-2-008, 1997.
URL : https://hal.archives-ouvertes.fr/inria-00099013

P. Borovansky, Implementation of higher-order unification based on calculus of explicit substitution, Proceedings of the SOFSEM'95: Theory and Practice of Informatics, pp.363-368, 1995.
DOI : 10.1007/3-540-60609-2_18

P. Borovansky, Le contrôle de la réécriture: étude et implantation d'un formalisme de stratégies, Thèse de, 1998.

P. Borovansky and C. Castro, Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELAN Proceedings of The Second International Workshop on Rewriting Logic and its Applications, WRLA '98, Electronic Notes in Theoretical Computer Science. Also available as Technical Report 98-R-305 of the Laboratoire lorrain de recherche en informatique et ses applications, pp.379-398, 1998.

P. Borovansky, C. Kirchner, and H. Kirchner, A functional view ofrewriting and strategies for a semantics of ELAN, The Third Fuji International Bibliographie Symposium on Functional and Logic Programming, pp.143-167, 1998.

M. Bruynooghe, Solving combinatorial search problems by intelligent backtracking, Information Processing Letters, vol.12, issue.1, pp.36-39, 1981.
DOI : 10.1016/0020-0190(81)90074-0

URL : https://lirias.kuleuven.be/bitstream/123456789/124460/1/IB1981.pdf

F. Caseau and . Laburthe, Improved CLP Scheduling with Task Intervals, Proceedings of The I1th International Conference on Logic Programming, ICLP'94, 1994.

Y. Caseau and F. Laburthe, Introduction to the CLAIRE Programming Language, Département Mathématiques et Informatique, Ecole Normale Supérieure, 1996.

C. Castro, Binary CSP solving as an inference process, Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence, pp.462-463, 1996.
DOI : 10.1109/TAI.1996.560786

C. Castro, Solving Binary CSP Using Computational Systems, Proceedings of The First International Workshop on Rewriting Logic and its Applications ElectronÏc Notes in Theoretical Computer Science. Also available as Technical Report 96-R-190 of the Centre de Recherche en Informatique de, pp.245-264, 1996.
DOI : 10.1016/S1571-0661(04)00042-8

C. Castro, Constraint Manipulation using Rewrite Rules and Strategies Proceedings of The Second ESSLLI Student Session, 9th European Summer School in Logic, Language and Information, ESSLLI'9'l, pp.45-56, 1997.

C. Castro, Manipulation de contraintes par des systèmes de calcul, Journées du Pôle Contraintes et Programmation Logique du PRC/GDR Programmation, pp.1-10, 1997.

C. Castro, An Arc-Consistency Aigorithm for CSPs Involving Disjunctive Constraints, 1998.

C. Castro, Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies, Also available as Technical Report 98-R-308 of the Laboratoire lorrain de recherche en informatique et ses applications, pp.263-293, 1998.

C. Castro, . Colette, C. Prototyping, and . Solvers, Using a Rule-Based Language, Proceedings of The Fourth International Conference on Artijicial Intelligence and Symbolic Computation, Theory, Implementations and Applications, AISC'98 Also available as Technical Report 98-R-304 of the Laboratoire lorrain de recherche en informatique et ses applications, pp.107-119, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00098514

C. Castro and E. Monfroy, A Strategy Language for Solving CSPs, Proceedings of The Third Workshop of the Working Group
URL : https://hal.archives-ouvertes.fr/inria-00098511

B. F. Caviness, On Canonical Forms and Simplification, Journal of the ACM, vol.17, issue.2, pp.385-396, 1970.
DOI : 10.1145/321574.321591

P. Cheeseman, B. Kanefsky, and W. M. Taylor, Where the Really Hard Problems Are, Proceedings of The Twelfth International Joint Conference on Artificial Intelligence, IJCA 1'91, pp.331-337, 1991.

H. Cirstea and C. Kirchner, Theorem proving using computational systems: The case of the B Predicate proyer, Proceedings of The International Conference on Constraints in Computational Logics, 1997.

M. Clavel, F. Duran, S. Eker, P. Lincoln, and J. Meseguer, An Introduction to Maude (Beta Version), 1998.

J. Cohen, Non-Deterministic Algorithms, ACM Computing Surveys, vol.11, issue.2, pp.79-94, 1979.
DOI : 10.1145/356770.356773

H. Comon, M. Dincbas, J. Jouannaud, and C. Kirchner, A Methodological View of Constraint Solving, Constraints, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00098856

G. Dantzig, Integer Programming and Extensions, 1972.

R. Debruyne, Les algorithmes d'arc-consistance dans les CSP dynamiques, pp.239-267, 1995.
URL : https://hal.archives-ouvertes.fr/hal-00442824

R. Dechter, Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition, Artificial Intelligence, vol.41, issue.3, pp.273-312, 1990.
DOI : 10.1016/0004-3702(90)90046-3

N. Dershowitz and E. M. Reingold, Calendrical Calculations, 1997.
DOI : 10.1002/spe.4380200905

URL : http://emr.cs.uiuc.edu/~reingold/calendar.ps

Y. Deville and P. V. Hentenryck, An efficient arc consistency algorithm for a class of csp problems, Proceedings of The Twelfth International Joint Conference on Artificial Intelligence, IJCA1'91, pp.325-330, 1991.

M. Dincbas, H. Simonis, and P. Van-hentenryck, Solving large combinatorial problems in logic programming, The Journal of Logic Programming, vol.8, issue.1-2, pp.75-93, 1990.
DOI : 10.1016/0743-1066(90)90052-7

F. Fages, Programmation Logique Par Contraintes, 1996.

R. E. Fikes, REF-ARF: A system for solving problems stated as procedures, Artificial Intelligence, vol.1, issue.1-2, pp.27-120, 1970.
DOI : 10.1016/0004-3702(70)90003-2

E. C. Freuder, Synthesizing constraint expressions, Communications of the ACM, vol.21, issue.11, pp.958-966, 1978.
DOI : 10.1145/359642.359654

E. C. Freuder, Using metalevel constraint knowledge to reduce constraint checking, Bibliographie Proceedings of the Workshop on Constraint Processing, ECAl'94, pp.27-33, 1994.
DOI : 10.1007/3-540-59479-5_25

T. Frühwirth, Constraint handling rules, Lecture Notes in Computer Science, vol.910, pp.90-107, 1994.
DOI : 10.1007/3-540-59155-9_6

K. Futatsugi and A. Nakagawa, An Overview of Cafe Project, Proceedings of First CafeOBJ Workshop, 1996.

F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, 1996.

J. H. Gallier, Logic for Computer Sciences, Foundations of Automatic Theorem Proving, 1986.

T. Genet and I. Gnaedig, Solving GPO ordering constraints with shared term data structure, 1995.

P. Gent and T. Walsh, Easy problems are sometimes hard, Artificial Intelligence, vol.70, issue.1-2, 1993.
DOI : 10.1016/0004-3702(94)90109-0

P. Gent and T. Walsh, The SAT Phase Transition, Research Paper, vol.679, 1994.

S. A. Grant and B. M. Smith, The Phase Transition Behaviour of Maintaining Arc Consistency, 1995.

S. A. Grant and B. M. Smith, The arc and path consistency phase transitions, 1996.
DOI : 10.1007/3-540-61551-2_106

H. Greenberg, Integer Progmmming Mathematics in science and engineering, 1971.

C. Han and C. Lee, Comments on Mohr and Henderson's path consistency algorithm, Artificial Intelligence, vol.36, issue.1, pp.125-130, 1988.
DOI : 10.1016/0004-3702(88)90081-1

R. M. Haralick and G. L. Elliot, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence, vol.14, issue.3, pp.263-313, 1980.
DOI : 10.1016/0004-3702(80)90051-X

J. Jouannaud and C. Kirchner, Solving Equations in Abstract Algebras: A Rule-Based Survey of Unification, Computational Logic. Essays in honor of Alan Robinson, pp.257-321, 1991.

J. Jourdan and T. Sola, The versatility of handling disjunctions as constraints, Proceedings of The 5th International Symposium on Programming Language Implementation and Logic Programming, PLILP'93 number 714 in Lecture Notes in Computer Science, pp.60-74, 1993.
DOI : 10.1007/3-540-57186-8_71

C. Kirchner, H. Kirchner, G. , I. Lorraine, and C. , Rewriting, Solving, Proving, 1995.

C. Kirchner, H. Kirchner, and M. Vittek, Implementing Computational Systems with Constraints, Proceedings of The First Workshop on Principles and Practice of Constraint Programming, pp.166-175, 1993.

C. Kirchner, H. Kirchner, and M. Vittek, Designing Constraint Logic Programming Languages using Computational Systems, Principles and Practice of Constraint Programming. The Newport Papers, pp.131-158

C. Kirchner, H. Kirchner, and M. Vittek, ELAN Version 1.17 User Manual, 1995.

C. Kirchner, C. Lynch, and C. Scharff, Fine-grained concurrent completion, Proceedings of The 6th Conference on Rewriting Techniques and Applications, pp.3-17, 1996.
DOI : 10.1007/3-540-61464-8_39

URL : https://hal.archives-ouvertes.fr/inria-00073707

C. Kirchner and C. Ringeissen, Rule-Based Constraint Programming. Fundamenta lnformaticae, pp.225-262, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00098476

H. Kirchner, On the use of constraints in automated deduction, Constraint Programming: Basics and Trends, pp.128-146, 1995.
DOI : 10.1007/3-540-59155-9_8

H. Kirchner and P. Moreau, Prototyping completion with constraints using computational systems, Proceedings of The 5th Conference on Rewriting Techniques and Applications, pp.438-443, 1995.
DOI : 10.1007/3-540-59200-8_79

H. Kirchner and P. Moreau, A reflective extension of ELAN, Proceedings of The First International Workshop on Rewriting Logic and Us Applications, RWLW'96 Electronic Notes in Theoretical Computer Science, 1996.
DOI : 10.1016/S1571-0661(04)00038-6

H. Kirchner and C. Ringeissen, Combining Symbolic Constraint Solvers on Algebraic Domains, Journal of Symbolic Computation, vol.18, issue.2, pp.113-155, 1994.
DOI : 10.1006/jsco.1994.1040

R. Kowalski, Algorithm = logic + control, Communications of the ACM, vol.22, issue.7, pp.424-435, 1979.
DOI : 10.1145/359131.359136

V. Kumar, Algorithms for Constraint-Satisfaction Problems: A Survey, Artificial Intelligence Magazine, vol.13, issue.1, pp.32-44, 1992.

A. Wan, E. Tsang, and J. Borrett, Phase transition in finding multiple solutions in constraint satisfaction problems, Workshop on Studying and Solving Really Hard Problems , First International Conference on Principles and Practice of Constraint Programming, pp.119-126, 1995.

A. H. Land and A. G. Doig, An automatic method of solving discrete programming problems, Econometrica, issue.497, p.28, 1960.

J. W. Lloyd, Foundations of Logic Programming, 1993.

A. K. Mackworth, Constraint Satisfaction, Encyclopedia of Artificial Intelligence, vol.1, 1992.

A. K. Mackworth, The logic of constraint satisfaction, Artificial Intelligence, vol.58, issue.1-3, pp.3-20, 1992.
DOI : 10.1016/0004-3702(92)90003-G

A. K. Mackworth and E. C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial Intelligence, vol.25, issue.1, pp.65-74, 1985.
DOI : 10.1016/0004-3702(85)90041-4

A. K. Mackworth and E. C. Freuder, The complexity of constraint satisfaction revisited, Artificial Intelligence, vol.59, issue.1-2, pp.57-62, 1993.
DOI : 10.1016/0004-3702(93)90170-G

P. Marti and M. Rueher, A DISTRIBUTED COOPERATING CONSTRAINTS SOLVING SYSTEM, International Journal on Artificial Intelligence Tools, vol.04, issue.01n02, pp.93-113, 1995.
DOI : 10.1142/S0218213095000061

J. Meseguer, General Logics, Logic Colloquium '87, pp.275-329, 1989.
DOI : 10.1016/S0049-237X(08)70132-0

R. Mohr and T. C. Henderson, Arc and path consistency revisited, Artificial Intelligence, vol.28, issue.2, pp.225-233, 1986.
DOI : 10.1016/0004-3702(86)90083-4

URL : https://hal.archives-ouvertes.fr/inria-00548487

. Monfroy, An Environment for DesigningjExecuting Constraint Solver Collaborations Rapport de Recherche 96-R-044, 1996.

E. Monfroy, Collaboration de solveurs pour la programmation logique à contraintes, 1996.
URL : https://hal.archives-ouvertes.fr/tel-01747888

. Monfroy, The Constraint Solver Collaboration Language of BALI. Short version of Research Report 96-R-044, 1996.

E. Monfroy, M. Rusinowitch, and R. Schott, Implementing non-linear constraints with cooperative solvers, Proceedings of the 1996 ACM symposium on Applied Computing , SAC '96, pp.63-72, 1996.
DOI : 10.1145/331119.331147

URL : https://hal.archives-ouvertes.fr/inria-00073945

U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing, Information Sciences, vol.7, pp.95-132, 1974.
DOI : 10.1016/0020-0255(74)90008-5

U. Montanari and F. Rossi, An efficient algorithm for the solution of hierarchical networks of constraints, Proceedings of Third International Workshop on Graph-Grammars and Their Application to Computer Science, pp.440-457, 1986.
DOI : 10.1007/3-540-18771-5_69

U. Montanari and F. Rossi, Constraint Solving and Programming: What next? Also in CONSTRAINTS: An international journal, ACM Computing Surveys, vol.28, issue.42, 1996.

P. Moreau and H. Kirchner, Compilation Techniques for Associative-Commutative Normalisation Proceedings of The Second International Workshop on the Theory and Practice of Algebraic Specijications, ASF+SDF'97, number CRIN 97-R-129 in Electronic Workshops in Computing, eWiC web site, 1997.

P. Moreau and H. Kirchner, A compiler for rewrite programs in associative-commutative theories, Proceedings of Programming Language Implementation and Logic Programming, PLILP'98, 1998.
DOI : 10.1007/BFb0056617

URL : https://hal.archives-ouvertes.fr/inria-00098451

B. A. Nadei, Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens, IEEE Expert, vol.5, issue.3, pp.16-23, 1990.

G. Nelson and D. C. Oppen, Simplification by Cooperating Decision Procedures, ACM Transactions on Programming Languages and Systems, vol.1, issue.2, pp.245-257, 1979.
DOI : 10.1145/357073.357079

URL : http://www.cse.iitb.ac.in/~sangramraje/references/4-NelsonOppen.pdf

N. J. Nilsson, Problem-Solving Methods in Arlificial Intelligence, Computer Science SE- RIES, 1971.

M. Perlin, Arc consistency for factorable relations, Artificial Intelligence, vol.53, issue.2-3, pp.329-342, 1992.
DOI : 10.1016/0004-3702(92)90077-B

P. Prosser, Domain filtering can degrade intelligent backtracking search, Proceedings of The 13th International Joint Conference on Arlificial Intelligence, IJCAI'93, pp.262-267, 1993.

C. Ringeissen, Cooperation of Decision Procedures for the Satisfiability Problem, Proceedings of The First International Workshop Frontiers of Combining Systems, FroCoS'96, pp.121-139, 1996.
DOI : 10.1007/978-94-009-0349-4_6

URL : https://hal.archives-ouvertes.fr/inria-00073939

C. Ringeissen, Prototyping combination of unification algorithms with the ELAN rule-based programming language, Proceedings of The 8th Conference on Rewriting Techniques and Applications, pp.323-326, 1997.
DOI : 10.1007/3-540-62950-5_81

A. Schrijver, Theory of Linear and Integer Programming Wiley Interscience Series in Discrete Mathematics, 1986.

C. Schulte, Oz Explorer: A visual constraint programming tool, Proceedings of The 14th International Conference on Logic Programming, ICLP'97, pp.286-300, 1997.
DOI : 10.1007/3-540-61756-6_108

B. M. Smith, The Phase Transition in Constraint Satisfaction Problems: A Closer Look at the Mushy Region, 1993.

B. M. Smith, In search of exceptionally difficult constraint satisfaction problems, 1994.
DOI : 10.1007/3-540-59479-5_23

G. Smolka, Problem Solving with Constraints and Programming Electronic Section, ACM Computing Surveys, vol.28, issue.4es, 1996.

E. Tsang, Foundations of Constraint Satisfaction, 1993.

M. V~n-den-brand, P. Klint, and C. Verhoef, Term Rewriting for Sale, Proceedings of The Second International Workshop on Rewriting Logic and its Applications, WRLA '98 Electronic Notes in Theoretical Computer Science, pp.139-161, 1998.
DOI : 10.1016/S1571-0661(05)80014-3

P. Van-hentenryck, Constraint Satisfaction in Logic Programming, 1989.

P. Van-hentenryck and Y. Deville, The Cardinality Operator: A new Logical Connective for Constraint Logic Programming, Proceedings of The Eighth International Conference on Logic Programming, ICLP'91, pp.745-759, 1991.

P. Van-hentenryck, V. Saraswat, and Y. Deville, Design, Implementation, and Evaluation of the Constraint Language cc(FD) In Constraint Programming: Basic and Trends. Selected Papers of the 22nd Spring School in Theoretical Computer Sciences, 1994.

G. Verfaillie and T. Schiex, Maintien de solution dans les problèmes dynamiques de satisfaction de contraintes: bilan de quelques approches. Revue d'Intelligence Artificielle, pp.269-309, 1995.

M. Vittek, ELAN: Un çadre logique pour le prototypage de langages de programmation avec contraintes, Thèse 'de, 1994.

R. L. Walker, An enumerative technique for a class of combinatorial problems, Combinatorial Analysis Proceedings of Symposium in Applied Mathematics, pp.91-94, 1960.
DOI : 10.1090/psapm/010/0121306

M. G. Wallace, Applying Constraints for Scheduling, Constraint Programming, NATO ASI Series, 1994.
DOI : 10.1007/978-3-642-85983-0_7

R. J. Wallace, Why AC-3 is almost always better than AC-4 for establishing arc concsistency in CSPs, Proceedings of The 13th International Joint Conference on Artificial Intelligence, IJCAI'93, pp.239-245, 1993.

D. Waltz, Understanding Hnes drawings of scenes with shadows The Psychology of Computer Vision, Computer Science Series, pp.19-91, 1975.

D. Warren, The Andorra Model, 1988.

C. Williams and T. Hogg, Exploiting the deep structure of constraint problems, Artificial Intelligence, vol.70, issue.1-2, pp.73-117, 1994.
DOI : 10.1016/0004-3702(94)90104-X

N. Wirth, Algorithms + Data Structures = Programs. Automatic Computation, 1976.

J. Würtz and T. Müller, Constructive Disjunction Revisited, Proceedings of The Twentieth German Annual Conference on Artificial Intelligence, p.96, 1996.

J. Zhou, Calcul de plus petits produits cartésiens d'intervalles: application au problème d'ordonnancement d'atelier, 1997.