S. Emantique-op-erationnelle-de-maj-configuration and .. , 48 4.3.1 Mise a jour de la connguration courant e 49 4.3.2 Modiication de l'arbre de recherche, p.52

.. Sp-ecialisation-de-l-'algorithme-de-r-eduction, 107 8.2.1 Consistance aux bornes Fonction d'approximation pour un CSP num erique, p.108

. De-plus, ariable (Ddel) e t l a r eunion d'explications permettant d'expliquer le minimumcourant ( Dwhy-min), le maximum courant ( Dwhy-max) e t l

M. Maher, 95: Workshop on Over-Constrained Systems at CP'95, Cassis, Marseilles, 18 Septembre, Brucker et al, p.144, 1994.

P. B-r-u-c-ker, J. Hurink, B. Jurisch, and E. B. Westmann, A branch and bound algorithm for the open-shop problem. Rapport technique, Osnabrueck U n i v ersity, p.53, 1994.

A. Caprara, M. Fischetti, and P. Toth, A heuristic algorithm for the set covering problem, Integer Programming and Combinatorial Optimization, p.145, 1989.
DOI : 10.1007/3-540-61310-2_6

J. Carlier and E. Pinson, An Algorithm for Solving the Job-Shop Problem, Management Science, vol.35, issue.2, pp.164-176, 1989.
DOI : 10.1287/mnsc.35.2.164

J. Carlier and E. Pinson, A practical use of jackson's preemptive s c hedule for solving the job shop problem, Carlier et Pinson, pp.269-287, 1990.

J. Carlier and E. Pinson, Adjustment of heads and tails for the job-shop problem, European Journal of Operational Research, vol.78, issue.2, pp.146-161, 1994.
DOI : 10.1016/0377-2217(94)90379-4

Y. Caseau and . Frann-cois-laburthe, Cumulative s c heduling with task intervals, Joint International Conference and Symposium on Logic Programming, p.38, 1995.

A. Andr-e-chamard, . Fischler, . Beno^-t-guinaudeau, and . Et-andr-e-guillaud, CHIC lessons on CLP methodology, Constraint Handling in Industry and Commerce), 1995.

W. John, E. W. Chinneck, and . Dravnieks, Locating minimal infeasible constraint sets in linear programs, ORSA Journal on Computing, vol.3, issue.7, pp.157-168, 1990.

A. Colmerauer, An introduction to Prolog III, Communications of the ACM, vol.33, issue.7, pp.69-90, 1990.
DOI : 10.1145/79204.79210

X. Cousin, Meilleures solutions en programmation logique, Proceedings Avignon'91, p.34, 1991.

P. David, Prise en compte de la s emantique dans les probl emes de satisfaction de contraintes : etude des contraintes fonctionnelles. T h ese de doctorat, II { Sciences et Techniques du Languedoc, F evrier, p.31, 1991.

. Bruno-de-backer, B. Henri, and . Eringer, An eecient solver for HCLP(R) Rapport technique, IBM France Scientiic Center, Pre-Conference Workshop on CLP), 1991.

. Bruno-de-backer, B. Henri, and . Eringer, Intelligent b a c ktracking for CLP languages: An application to CLP(R), ILPS'91: Proceedings International Logic Programming Symposium, pp.405-419, 1991.

J. De and K. , An assumption-based tms, Artiicial Intelligence, vol.28, pp.127-162, 1986.

J. De and K. , Extending the ATMS, Artiicial Intelligence, vol.28, pp.163-196, 1986.

J. De and K. , Problem solving with the ATMS, Artiicial Intelligence, vol.28, pp.197-224, 1986.

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

R. Dechter and A. Dechter, Belief maintenance in dynamic constraint networks

T. Schiex and . Verfaillie, Nogood recording for static and dynamic CSP, 5 th IEEE International Conference o n T ools with Artiicial Intelligence Schiex et Verfaillie, pp.48-55, 1993.

T. Schiex and . Verfaillie, NOGOOD RECORDING FOR STATIC AND DYNAMIC CONSTRAINT SATISFACTION PROBLEMS, International Journal on Artificial Intelligence Tools, vol.03, issue.02, pp.187-207, 1994.
DOI : 10.1142/S0218213094000108

T. Schiex and G. Verfaillie, Valued constraint satisfaction problems: Hard and easy problems, Chris Mellish, editeur, IJCAI'95: Proceedings International Joint Conference o n A rtiicial Intelligence, pp.22-32, 1992.

T. Schiex, Possibilistic constraint satisfaction problems or \How t o h a n d l e soft constraints?, 8th International Conference o n U n c ertainty in Artiicial Intelligence, p.126, 1992.

B. Smith and S. Grant, Sparse constraint graphs and exceptionally hard problems, Chris Mellish, editeur, IJCAI'95: Proceedings International Joint Conference o n A rtiicial Intelligence, p.126, 1994.
DOI : 10.1007/bfb0017439
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.434

B. Smith, The phase transition in constraint satisfaction problems: A closer look at the mushy region, Proceedings ECAI'94, 1994.

T. Sola, Mod eles d'ex ecution de la Programmation Logique bas es sur le graphe de d ependances des liaisons, Backtracking Intelligent, p.34, 1997.

G. Trombettoni, Algorithmes de maintien de solution par propagation local pour les syst emes de contraintes. T h ese de doctorat, p.64, 1993.

E. Tsang, Foundations of Constraint Satisfaction, p.27, 1989.

P. Van and H. , Incremental constraint satisfaction in logic programming, Proceedings 6 th International Conference o n L ogic Programming, pp.65-85, 1989.

P. Van-hentenryck, Y. Deville, . Et-choh-man, and . Teng, A generic arc-consistency algorithm and its specializations, Artificial Intelligence, vol.57, issue.2-3, pp.291-321, 1992.
DOI : 10.1016/0004-3702(92)90020-X

P. Van-hentenryck-e-t and Y. Es-deville, The cardinality operator: A new logical connective for constraint logic programming, Koichi Furukawa, editeur, ICLP'91 Proceedings 8th International Conference o n L ogic Programming 166 R ef erences bibliographiques Van Hentenryck, pp.745-759, 1989.

P. Van and H. , Constraint Satisfaction in Logic Programming. L o g i c Programming Series, p.142, 1989.

C. Varnier, P. Baptiste, and E. B. Legeard, Le traitement des contraintes disjonctives d a n s u n p r o b l eme d'ordonnancement : le hoist scheduling problem, Proceedings Journ ees Frann caises de Programmation en Logique Verfaillie et Schiex, 1993.

G. , V. , and T. Schiex, Solution reuse in dynamic constraint satisfaction problems, AAAI'94, pp.307-312, 1994.

G. , V. , and T. Schiex, Maintien de solution dans les probl emes dynamiques de satisfaction de contraintes : bilan de quelques approches, 1995.

R. Wallace and E. C. Freuder, Heuristic methods for over-constrained constraint satisfaction problems, Over-Constrained Systems, n um ero 1106 in Lecture Notes in Computer Science, pp.207-216, 1996.
DOI : 10.1007/3-540-61479-6_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.2338

R. Wallace, Cascaded arc consistency preprocessing as a strategy for maximal constraint satisfaction In Over-Constrained Systems, n um ero 1106 in Lecture Notes in Computer Science, pages 217{228, Williamson et al, vol.1, pp.9-9, 1996.

M. Wilson and A. Borning, Hierarchical constraint logic programming, The Journal of Logic Programming, vol.16, issue.3-4, pp.277-318, 1993.
DOI : 10.1016/0743-1066(93)90046-J
URL : http://doi.org/10.1016/0743-1066(93)90046-j

.. 14-comparateur and C. Comparateur, 24 19 Syst eme de relaxation de contraint e s, 35 22 Eliminating explanation selon Verfaillie et Schiex Connguration prometteuse . . . . . . . . . . . . . . . . . . . . . . . . 44 25 Recouvrement { Gondran et Minoux, pp.17-18, 1990.

{. Validit-e and .. Nouvelle-ve-r-s-i-o-n, 73 45 Param etre statique 74 47 Explication d'ensemb l e, p.84

.. Syst-eme-bien-fond-e and C. Cp, 90 13 Compl etude et non conservation, p.11

.. Retrait-de-relation, 78 7 R eint r o d u c t i o n d e r e l a t i o n, pp.8-89

.. Probl-emes-lin-e-a-i-r-e-s, 18 6 CSP num eriques, p.22

.. Arbre-de-la-recherch-e, 42 13 Relation connguration -branche, p.43

.. Graphe-de-d-ependance-de-d-eductions, 70 25 Syst eme d'explication mal fond e, pp.26-73