@STRING{AI = "Artificial Intelligence"}
@STRING{JAIR = "Journal of Artificial Intelligence Research"}
@STRING{RIA = "Revue d'Intelligence Artificielle"}
@STRING{CI = "Computational Intelligence"}
@STRING{IPL = "Information Processing Letters"}
@STRING{CO = "Constraints~: An International Journal"}
@STRING{JETAI = "Journal of Experimental and Theoretical Artificial Intelligence"}
@STRING{AAI = "Applied Artificial Intelligence"}
@STRING{IJAIT = "International Journal of Artificial Intelligence Tools"}
@STRING{AST = "Aerospace Science and Technology"}
@STRING{IJCAI69P = "Proc.\ of the 1st International Joint Conference
          on Artificial Intelligence (IJCAI-69)"}
@STRING{IJCAI69L = "Washington, DC, USA"}
@STRING{IJCAI71P = "Proc.\ of the 2nd International Joint Conference
          on Artificial Intelligence (IJCAI-71)"}
@STRING{IJCAI71L = "London, UK"}
@STRING{IJCAI73P = "Proc.\ of the 3rd International Joint Conference
          on Artificial Intelligence (IJCAI-73)"}
@STRING{IJCAI73L = "Stanford, MA, USA"}
@STRING{IJCAI75P = "Proc.\ of the 4th International Joint Conference
          on Artificial Intelligence (IJCAI-75)"}
@STRING{IJCAI75L = "Tiblisi, USSR"}
@STRING{IJCAI77P = "Proc.\ of the 5th International Joint Conference
          on Artificial Intelligence (IJCAI-77)"}
@STRING{IJCAI77L = "Cambridge, MA, USA"}
@STRING{IJCAI79P = "Proc.\ of the 6th International Joint Conference
          on Artificial Intelligence (IJCAI-79)"}
@STRING{IJCAI79L = "Tokyo, Japan"}
@STRING{IJCAI81P = "Proc.\ of the 7th International Joint Conference
          on Artificial Intelligence (IJCAI-81)"}
@STRING{IJCAI81L = "Vancouver, Canada"}
@STRING{IJCAI83P = "Proc.\ of the 8th International Joint Conference
          on Artificial Intelligence (IJCAI-83)"}
@STRING{IJCAI83L = "Karlsruhe, Germany"}
@STRING{IJCAI85P = "Proc.\ of the 9th International Joint Conference
          on Artificial Intelligence (IJCAI-85)"}
@STRING{IJCAI85L = "Los Angeles, CA, USA"}
@STRING{IJCAI87P = "Proc.\ of the 10th International Joint Conference
          on Artificial Intelligence (IJCAI-87)"}
@STRING{IJCAI87L = "Milan, Italy"}
@STRING{IJCAI89P = "Proc.\ of the 11th International Joint Conference
          on Artificial Intelligence (IJCAI-89)"}
@STRING{IJCAI89L = "Detroit, MI, USA"}
@STRING{IJCAI91P = "Proc.\ of the 12th International Joint Conference
          on Artificial Intelligence (IJCAI-91)"}
@STRING{IJCAI91L = "Sidney, Australia"}
@STRING{IJCAI93P = "Proc.\ of the 13th International Joint Conference
          on Artificial Intelligence (IJCAI-93)"}
@STRING{IJCAI93L = "Chamb\'ery, France"}
@STRING{IJCAI95P = "Proc.\ of the 14th International Joint Conference
          on Artificial Intelligence (IJCAI-95)"}
@STRING{IJCAI95L = "Montr{\'e}al, Canada"}
@STRING{IJCAI97P = "Proc.\ of the 15th International Joint Conference
          on Artificial Intelligence (IJCAI-97)"}
@STRING{IJCAI97L = "Nagoya, Japan"}
@STRING{IJCAI99P = "Proc.\ of the 16th International Joint Conference
          on Artificial Intelligence (IJCAI-99)"}
@STRING{IJCAI99L = "Stockholm, Sweden"}
@STRING{IJCAI01P = "Proc.\ of the 17th International Joint Conference
          on Artificial Intelligence (IJCAI-01)"}
@STRING{IJCAI01L = "Seattle, WA, USA"}
@STRING{IJCAI03P = "Proc.\ of the 18th International Joint Conference
          on Artificial Intelligence (IJCAI-03)"}
@STRING{IJCAI03L = "Acapulco, Mexico"}
@STRING{AAAI80P = "Proc.\ of the 1st National Conference on
          Artificial Intelligence (AAAI-80)"}
@STRING{AAAI80L = "Stanford, CA, USA"}
@STRING{AAAI82P = "Proc.\ of the 2nd National Conference on
          Artificial Intelligence (AAAI-82)"}
@STRING{AAAI82L = "Pittsburgh, PA, USA"}
@STRING{AAAI83P = "Proc.\ of the 3rd National Conference on
          Artificial Intelligence (AAAI-83)"}
@STRING{AAAI83L = "Washington, DC, USA"}
@STRING{AAAI84P = "Proc.\ of the 4th National Conference on
          Artificial Intelligence (AAAI-84)"}
@STRING{AAAI84L = "Austin, TX, USA"}
@STRING{AAAI86P = "Proc.\ of the 5th National Conference on
          Artificial Intelligence (AAAI-86)"}
@STRING{AAAI86L = "Philadelphia, PA, USA"}
@STRING{AAAI87P = "Proc.\ of the 6th National Conference on
          Artificial Intelligence (AAAI-87)"}
@STRING{AAAI87L = "Seattle, WA, USA"}
@STRING{AAAI88P = "Proc.\ of the 7th National Conference on
          Artificial Intelligence (AAAI-88)"}
@STRING{AAAI88L = "St. Paul, MN, USA"}
@STRING{AAAI90P = "Proc.\ of the 8th National Conference on
          Artificial Intelligence (AAAI-90)"}
@STRING{AAAI90L = "Boston, MA, USA"}
@STRING{AAAI91P = "Proc.\ of the 9th National Conference on
          Artificial Intelligence (AAAI-91)"}
@STRING{AAAI91L = "Anaheim, CA, USA"}
@STRING{AAAI92P = "Proc.\ of the 10th National Conference on
          Artificial Intelligence (AAAI-92)"}
@STRING{AAAI92L = "San Jose, CA, USA"}
@STRING{AAAI93P = "Proc.\ of the 11th National Conference on
          Artificial Intelligence (AAAI-93)"}
@STRING{AAAI93L = "Washington, DC, USA"}
@STRING{AAAI94P = "Proc.\ of the 12th National Conference on
          Artificial Intelligence (AAAI-94)"}
@STRING{AAAI94L = "Seattle, WA, USA"}
@STRING{AAAI96P = "Proc.\ of the 13th National Conference on
          Artificial Intelligence (AAAI-96)"}
@STRING{AAAI96L = "Portland, OR, USA"}
@STRING{AAAI97P = "Proc.\ of the 14th National Conference on
          Artificial Intelligence (AAAI-97)"}
@STRING{AAAI97L = "Providence, RI, USA"}
@STRING{AAAI98P = "Proc.\ of the 15th National Conference on
          Artificial Intelligence (AAAI-98)"}
@STRING{AAAI98L = "Madison, WI, USA"}
@STRING{AAAI99P = "Proc.\ of the 16th National Conference on
          Artificial Intelligence (AAAI-99)"}
@STRING{AAAI99L = "Orlando, FL, USA"}
@STRING{AAAI00P = "Proc.\ of the 17th National Conference on
          Artificial Intelligence (AAAI-00)"}
@STRING{AAAI00L = "Austin, TX, USA"}
@STRING{AAAI02P = "Proc.\ of the 18th National Conference on
          Artificial Intelligence (AAAI-02)"}
@STRING{AAAI02L = "Edmonton, Alberta, Canada"}
@STRING{ECAI88P = "Proc.\ of the 8th European Conference on
          Artificial Intelligence (ECAI-88)"}
@STRING{ECAI88L = "Munich, Germany"}
@STRING{ECAI90P = "Proc.\ of the 9th European Conference on
          Artificial Intelligence (ECAI-90)"}
@STRING{ECAI90L = "Stockholm, Sweden"}
@STRING{ECAI92P = "Proc.\ of the 10th European Conference on
          Artificial Intelligence (ECAI-92)"}
@STRING{ECAI92L = "Vienna, Austria"}
@STRING{ECAI94P = "Proc.\ of the 11th European Conference on
          Artificial Intelligence (ECAI-94)"}
@STRING{ECAI94L = "Amsterdam, The Netherlands"}
@STRING{ECAI96P = "Proc.\ of the 12th European Conference on
          Artificial Intelligence (ECAI-96)"}
@STRING{ECAI96L = "Budapest, Hungary"}
@STRING{ECAI98P = "Proc.\ of the 13th European Conference on
          Artificial Intelligence (ECAI-98)"}
@STRING{ECAI98L = "Brighton, UK"}
@STRING{ECAI00P = "Proc.\ of the 14th European Conference on
          Artificial Intelligence (ECAI-00)"}
@STRING{ECAI00L = "Berlin, Germany"}
@STRING{ECAI02P = "Proc.\ of the 15th European Conference on
          Artificial Intelligence (ECAI-02)"}
@STRING{ECAI02L = "Lyon, France"}
@STRING{ICTAI93P = "Proc.\ of the 5th IEEE International Conference
          on Tools with Artificial Intelligence (ICTAI-93)"}
@STRING{ICTAI93L = "Boston, MA, USA"}
@STRING{ICTAI94P = "Proc.\ of the 6th IEEE International Conference
          on Tools with Artificial Intelligence (ICTAI-94)"}
@STRING{ICTAI94L = "New Orleans, LA, USA"}
@STRING{ICTAI96P = "Proc.\ of the 8th IEEE International Conference
          on Tools with Artificial Intelligence (ICTAI-96)"}
@STRING{ICTAI96L = "Toulouse, France"}
@STRING{PPCP93P = "Proc.\ of the 1993 Workshop on Principles and
          Practice of Constraint Programming (PPCP-93)"}
@STRING{PPCP93L = "Newport, RI, USA"}
@STRING{CP95P = "Proc.\ of the 1st International Conference on Principles and Practice of Constraint Programming (CP-95, LNCS 976)"}
@STRING{CP95L = "Cassis, France"}
@STRING{CP96P = "Proc.\ of the 2nd International Conference on Principles and Practice of Constraint Programming (CP-96, LNCS 1118)"}
@STRING{CP96L = "Cambridge, MA, USA"}
@STRING{CP97P = "Proc.\ of the 3rd International Conference on Principles and Practice of Constraint Programming (CP-97)"}
@STRING{CP97L = "Schloss Hagenberg, Austria"}
@STRING{CP98P = "Proc.\ of the 4th International Conference on Principles and Practice of Constraint Programming (CP-98)"}
@STRING{CP98L = "Pisa, Italia"}
@STRING{CP99P = "Proc.\ of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99)"}
@STRING{CP99L = "Alexandria, VA, USA"}
@STRING{CP00P = "Proc.\ of the 6th International Conference on Principles and Practice of Constraint Programming (CP-00)"}
@STRING{CP00L = "Singapore"}
@STRING{CP01P = "Proc.\ of the 7th International Conference on Principles and Practice of Constraint Programming (CP-01)"}
@STRING{CP01L = "Paphos, Cyprus"}
@STRING{CP02P = "Proc.\ of the 8th International Conference on Principles and Practice of Constraint Programming (CP-02)"}
@STRING{CP02L = "Ithaca, New York, USA"}
@STRING{CP03P = "Proc.\ of the 9th International Conference on Principles and Practice of Constraint Programming (CP-03)"}
@STRING{CP03L = "Cork, Ireland"}
@STRING{CPAIOR99P = "Proc.\ of the 1st International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-99)"}
@STRING{CPAIOR99L = "Ferrara, Italy"}
@STRING{CPAIOR00P = "Proc.\ of the 2nd International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-00)"}
@STRING{CPAIOR00L = "Paderborn, Germany"}
@STRING{CPAIOR01P = "Proc.\ of the 3rd International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-01)"}
@STRING{CPAIOR01L = "Ashford, UK"}
@STRING{CPAIOR02P = "Proc.\ of the 4th International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-02)"}
@STRING{CPAIOR02L = "Le Croisic, France"}
@STRING{CPAIOR03P = "Proc.\ of the 5th International Workshop on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR-03)"}
@STRING{CPAIOR03L = "Montr{\'e}al, Canada"}
@STRING{Avignon88P = "Proc.\ of the 8th International Workshop on
          Expert Systems and Their Applications (Avignon-88)"}
@STRING{Avignon88L = "Avignon, France"}
@STRING{Avignon89P = "Proc.\ of the 9th International Workshop on
          Expert Systems and Their Applications (Avignon-89)"}
@STRING{Avignon89L = "Avignon, France"}
@STRING{Avignon90P = "Proc.\ of the 10th International Workshop on
          Expert Systems and Their Applications (Avignon-90)"}
@STRING{Avignon90L = "Avignon, France"}
@STRING{Avignon91P = "Proc.\ of the 11th International Conference on
          Expert Systems and Their Applications (Avignon-91)"}
@STRING{Avignon91L = "Avignon, France"}
@STRING{Avignon92P = "Proc.\ of the 12th International Conference on
          Artificial Intelligence, Expert Systems and Natural
          Language (Avignon-92)"} 
@STRING{Avignon92L = "Avignon, France"}
@STRING{Avignon93P = "Proc.\ of the 13th International Conference on
          Artificial Intelligence, Expert Systems and Natural
          Language (Avignon-93)"} 
@STRING{Avignon93L = "Avignon, France"}
@STRING{ConventionIA89P = "Actes de la Conf{\'e}rence Europ{\'e}enne sur les
          Techniques et les Applications de l'Intelligence
          Artificielle en Milieu Industriel et de Service"} 
@STRING{ConventionIA89L = "Paris, France"}
@STRING{PRCIA92P = "Actes des 4i{\`e}mes Journ{\`e}es Nationales du PRC-GDR Intelligence Artificielle"} 
@STRING{PRCIA92L = "Marseille, France"}
@STRING{PRCIA95P = "Actes des 5i{\`e}mes Journ{\`e}es Nationales du PRC-GDR Intelligence Artificielle"} 
@STRING{PRCIA95L = "Nancy, France"}
@STRING{CNPC96P = "Actes de la 2i\`eme Conf\'erence Nationale sur la R\'esolution Pratique de Probl\`emes NP-Complets (CNPC-96)"} 
@STRING{CNPC96L = "Dijon, France"}
@STRING{JNPC97P = "Actes des 3i\`emes Journ\'ees Nationales sur la R\'esolution Pratique de Probl\`emes NP-Complets (JNPC-97)"} 
@STRING{JNPC97L = "Rennes, France"}
@STRING{JNPC98P = "Actes des 4i\`emes Journ\'ees Nationales sur la R\'esolution Pratique de Probl\`emes NP-Complets (JNPC-98)"} 
@STRING{JNPC98L = "Nantes, France"}
@STRING{JNPC99P = "Actes des 5i\`emes Journ\'ees Nationales sur la R\'esolution Pratique de Probl\`emes NP-Complets (JNPC-99)"} 
@STRING{JNPC99L = "Lyon, France"}
@STRING{JNPC00P = "Actes des 6i\`emes Journ\'ees Nationales sur la R\'esolution Pratique de Probl\`emes NP-Complets (JNPC-99)"} 
@STRING{JNPC00L = "Marseille, France"}
@STRING{JNPC01P = "Actes des 7i\`emes Journ\'ees Nationales sur la R\'esolution Pratique de Probl\`emes NP-Complets (JNPC-99)"} 
@STRING{JNPC01L = "Toulouse, France"}
@STRING{RJCIA98P = "Actes des 4i\`emes Rencontres des Jeunes
          Chercheurs en Intelligence Artificielle (RJCIA-98)"} 
@STRING{RJCIA98L = "Toulouse, France"}
@STRING{SpaceOps92P = "Proc.\ of the 2nd International Symposium on
          Ground Data Systems for Space Mission Operations (SpaceOps-92)"}  
@STRING{SpaceOps92L = "Pasadena, CA, USA"}
@STRING{SpaceOps96P = "Proc.\ of the 4th International Symposium on Space
                  Mission Operations and Ground Data Systems
                  (SpaceOps-96)"} 
@STRING{SpaceOps96L = "M{\"u}nich, Germany"}
@STRING{SpaceOps98P = "Proc.\ of the 5th International Symposium on Space
                  Mission Operations and Ground Data Systems
                  (SpaceOps-98)"} 
@STRING{SpaceOps98L = "Tokyo, Japan"}
@STRING{SpaceOps00P = "Proc.\ of the 6th International Symposium on Space Operations at the Start of the 3rd Millennium
                  (SpaceOps-00)"} 
@STRING{SpaceOps00L = "Toulouse, France"}
@STRING{SAIRAS94P = "Proc.\ of the 3rd International Symposium on
          Artificial Intelligence, Robotics, and Automation
          for Space (i-SAIRAS-94)"} 
@STRING{SAIRAS94L = "Pasadena, CA, USA"}
@STRING{SAIRAS97P = "Proc.\ of the 4th International Symposium on
          Artificial Intelligence, Robotics, and Automation
          for Space (i-SAIRAS-97)"} 
@STRING{SAIRAS97L = ""}
@STRING{SAIRAS99P = "Proc.\ of the 5th International Symposium on
          Artificial Intelligence, Robotics, and Automation
          for Space (i-SAIRAS-99)"} 
@STRING{SAIRAS99L = "Noordwijk, The Netherlands"}
@STRING{SAIRAS01P = "Proc.\ of the 6th International Symposium on
          Artificial Intelligence, Robotics, and Automation
          for Space (i-SAIRAS-01)"} 
@STRING{SAIRAS01L = "Montreal, Canada"}
@STRING{ESTEC93P = "Proc.\ of the 4th ESA Workshop on Artificial
          Intelligence and Knowledge Based Systems for Space"} 
@STRING{ESTEC93L = "Noordwijk, The Netherlands"}
@STRING{ESTEC95P = "Proc.\ of the 5th ESA Workshop on Artificial
          Intelligence and Knowledge Based Systems for Space"} 
@STRING{ESTEC95L = "Noordwijk, The Netherlands"}
@STRING{SCD99P = "Proc.\ of the 2nd International Symposium on
          Spacecraft Ground Control and Data Systems
          (SCDII)"}  
@STRING{SCD99L = "Foz do Igua\c{c}u, Brazil"}
@STRING{KR91P = "Proc.\ of the 1st International Conference on
                  the Principles of Knowledge Representation and
          Reasoning (KR-91)"} 
@STRING{KR91L = "Cambridge, Massachusetts, USA"}
@STRING{KR94P = "Proc.\ of the 4th International Conference on
                  the Principles of Knowledge Representation and
          Reasoning (KR-94)"} 
@STRING{KR94L = "Bonn, Germany"}
@STRING{KR98P = "Proc.\ of the 6th International Conference on
                  the Principles of Knowledge Representation and
          Reasoning (KR-98)"} 
@STRING{KR98L = "Trento, Italy"}
@STRING{KR00P = "Proc.\ of the 7th International Conference on
                  the Principles of Knowledge Representation and
          Reasoning (KR-00)"} 
@STRING{KR00L = "Breckenridge, CO, USA"}
@STRING{EUFIT93P = "Proc.\ of the 1st European Congress on Fuzzy and
          Intelligent Technologies (EUFIT-93)"} 
@STRING{EUFIT93L = "Germany"}
@STRING{EUFIT97P = "Proc.\ of the 5th European Congress on Intelligent Techniques and Soft Computing (EUFIT-97)"} 
@STRING{EUFIT97L = "Aachen, Germany"}
@STRING{ECSQARU93P = "Proc.\ of the European Conference on
          Symbolic and Quantitavive Approaches of Reasoning
          under Uncertainty (ECSQARU-93)"} 
@STRING{ECSQARU93L = "Grenade, Spain"}
@STRING{UAI92P = "Proc.\ of the 8th International Conference on
          Uncertainty in Artificial Intelligence (UAI-92)"} 
@STRING{UAI92L = "Stanford, CA, USA"}
@STRING{UAI95P = "Proc.\ of the International Conference on
          Uncertainty in Artificial Intelligence (UAI-95)"} 
@STRING{UAI95L = "Montr{\'e}al, Canada"}
@STRING{ICLP89P = "Proc.\ of the 6th International Conference on
          Logic programming (ICLP-89)"} 
@STRING{ICLP89L = "Lisbon, Portugal"}
@STRING{ROADEF99P = "Actes du Deuxi{\`e}me Congr{\`e}s de la Soci{\'e}t{\'e} Fran\c{c}aise
          de Recherche Op{\'e}rationnelle et d'Aide {\`a} la D{\'e}cision
          (ROADEF-99)"}  
@STRING{ROADEF99L = "Autrans, France"}
@STRING{ROADEF00P = "Actes du Troisi{\`e}me Congr{\`e}s de la Soci{\'e}t{\'e} Fran\c{c}aise
          de Recherche Op{\'e}rationnelle et d'Aide {\`a} la D{\'e}cision
          (ROADEF-00)"}  
@STRING{ROADEF00L = "Nantes, France"}
@STRING{AIPS00P = "Proc.\ of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS-00)"} 
@STRING{AIPS00L = "Breckenridge, CO, USA"}
@STRING{AIPS02P = "Proc.\ of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS-02)"} 
@STRING{AIPS02L = "Toulouse, France"}
@STRING{AIPS03P = "Proc.\ of the Seventh International Conference on Artificial Intelligence Planning and Scheduling (AIPS-03)"} 
@STRING{AIPS03L = "Trento, Italy"}
@STRING{ECP01P = "Proc.\ of the Sixth European Conference on Planning (ECP-01)"} 
@STRING{ECP01L = "Toledo, Spain"}

%%% LEDL: Introduction to the dynamic constraint solving setting

@inproceedings{Dechter88a,
     AUTHOR = {R. Dechter and A. Dechter},  
     TITLE = {Belief {M}aintenance in {D}ynamic {C}onstraint
          {N}etworks},   
     BOOKTITLE =  AAAI88P,  
     ADDRESS =  AAAI88L,  
     PAGES = {37-42},  
     YEAR =  1988,
     KIND = {LEDL},
     NOTE = {{\bf Introduction to the so-called "Dynamic Constraint Satisfaction Problem". A Dynamic CSP is defined as a sequence of CSPs, each one resulting from some change in the previous one.}}
}

@inproceedings{Mittal90a,
     AUTHOR = {S. Mittal and B. Falkenhainer},  
     TITLE = {Dynamic {C}onstraint {S}atisfaction {P}roblems},  
     BOOKTITLE =  AAAI90P,  
     ADDRESS =  AAAI90L,  
     PAGES = {25-32},  
     YEAR =  1990,
     KIND = {LEDL},
     NOTE ={{\bf Introduction to the so-called "Dynamic Constraint Satisfaction Problem", different from the previous one. In this definition, the solutions do not have all the same structure. Constraints are of two types: usual "Compatibility" constraints and "Activity" constraints which may activate or deactivate variables, depending on the assignment of other variables. Maybe the term "Conditional" would be more appropriate.}}
}

@inproceedings{Faltings02a,
     AUTHOR = {B. Faltings and S. Macho-Gonzalez},   
     TITLE = {\htmladdnormallink
             {Open {C}onstraint {S}atisfaction}{http://citeseer.nj.nec.com/526266.html}}, 
     BOOKTITLE =  CP02P, 
     ADDRESS =  CP02L, 
     PAGES = {356-370}, 
     YEAR =  2002,
     KIND = {LEDL},
     NOTE = {{\bf Introduction to the so-called "Open Constraint Satisfaction Problem". In an Open CSP, variable domains are not completely defined when starting solving. Variable values can be acquired when necessary during solving.}}
}

@inproceedings{Lamma99a,
     AUTHOR = {E. Lamma and P. Mello and M. Milano and R. Cucchiara and M. Gavanelli and M. Piccardi},  
     TITLE = {\htmladdnormallink
             {Constraint {P}ropagation and {V}alue {A}cquisition: {W}hy we should do it {I}nteractively}{http://citeseer.nj.nec.com/lamma99constraint.html}},
     BOOKTITLE =  IJCAI99P,
     ADDRESS =  IJCAI99L,
     YEAR =  1999,
     KIND = {LEDL},
     NOTE = {{\bf Introduction to the so-called "Interactive Constraint Satisfaction Problem", similar to the Open one. Variable domains are not completely defined when starting solving. Variable values can be acquired when necessary during solving.}}
}

@article{Miguel99a,
     AUTHOR = {I. Miguel and Q. Shen},  
     TITLE = {\htmladdnormallink
             {Hard, {F}lexible and {D}ynamic {C}onstraint {S}atisfaction}{http://www-users.cs.york.ac.uk/~ianm/docs/KER.ps.gz}},  
     JOURNAL =  {Knowledge Engineering Review},  
     VOLUME =  14,
     NUMBER = 3, 
     PAGES = {199-220},  
     YEAR =  1999,
     KIND = {LEDL},
     NOTE = {{\bf Presentation of the soft and dynamic constraint satisfaction problem. Problem introduction without solving method.}}
}

@article{Montanari97a,
     AUTHOR = {U. Montanari and F. Rossi}, 
     TITLE  = {Constraint {S}olving and {P}rogramming: {W}hat {N}ext?},    
     JOURNAL =  CO,  
     VOLUME =  2,
     NUMBER = 1,  
     PAGES = {87-91},  
     YEAR =  1997,
     KIND = {LEDL},
     NOTE = {{\bf Description of the most important challenges beyond currently available constraint reasoning tools, including dynamic constraint solving.}}
}

@unpublished{Davenport03a,
     AUTHOR = {A. Davenport and C. Beck},
     TITLE = {A {S}urvey of {T}echniques for {S}cheduling with {U}ncertainty}, 
     KIND = {LEDL},
     NOTE = {{\bf Unpublished. See http://4c.ucc.ie/\~{}jcb/publications.html. A survey focused on a related domain: scheduling.}}
}

%%% CDL: Reactive methods. Search for a minimum change

@inproceedings{Bellicha93a,
    AUTHOR = {A. Bellicha},
    TITLE  = {Maintenance of {S}olution in a {D}ynamic
          {C}onstraint {S}atisfaction {P}roblem}, 
    BOOKTITLE = {Proc.\ of Applications of Artificial Intelligence
          in Engineering VIII},
        ADDRESS = {Toulouse, France}, 
        PAGES = {261-274},
    YEAR = 1993,
        KIND = {CDL},
        NOTE = {{\bf Search for a solution at a minimum distance from the previous solution in dynamic binary constraint satisfaction problems. Distance measured  in terms of number of differently assigned variables.}} 
}

@inproceedings{Ran02a,
     AUTHOR = {Y. Ran and N. Roos and J. van den Herik},  
     TITLE = {\htmladdnormallink
             {Approaches to {F}ind a {N}ear-minimal {C}hange {S}olution for {D}ynamic {CSP}s}{http://www.cs.unimaas.nl/~roos/publications/CP-AI-OR.pdf}}, 
     BOOKTITLE = CPAIOR02P, 
     ADDRESS =  CPAIOR02L,
     YEAR =  2002,
     KIND = {CDL},
     NOTE = {{\bf Search for a solution at a minimum distance from the previous solution in dynamic constraint satisfaction problems. Distance measured  in terms of number of differently assigned variables. Algorithm inspired from HR (Heuristic Repair) and LDS (Limited Discrepancy Search).}} 
}

@inproceedings{Bartak03a,
     AUTHOR = {R. Bart{\'a}k and T. M{\"u}ller and H. Rudov{\'a}}, 
     TITLE = {\htmladdnormallink
             {Minimal {P}erturbation {P}roblem - {A} {F}ormal {V}iew}{http://ws.ailab.sztaki.hu/Bartak_Muller_Rudova.pdf}},  
     BOOKTITLE =  {Proc.\ of the Joint Workshop of the ERCIM Working Group on Constraints and of the CologNet area on Constraint and Logic Programming},   
     ADDRESS =  {Budapest, Hungary},  
     YEAR =  2003,
     KIND = {CDL},
     NOTE = {{\bf Search for a solution at a minimum distance from the previous solution in dynamic constraint satisfaction problems. Distance measured  in terms of number of differently assigned variables. Problem description without solving method.}}
}

@article{ElSakkout00a,
     AUTHOR = {H. El Sakkout and M. Wallace}, 
     TITLE  = {\htmladdnormallink
             {Probe {B}acktrack {S}earch for {M}inimal {P}erturbation in {D}ynamic {S}cheduling}{http://citeseer.nj.nec.com/elsakkout99probe.html}},    
     JOURNAL =  CO,  
     VOLUME =  5,
     NUMBER = 4,  
     YEAR =  2000,
     KIND = {CDL},
     NOTE = {{\bf Search for a solution at a minimum distance from the previous solution in dynamic scheduling problems. Distance measured in terms of sum of the shifts in the temporal variables (start and end times of the activities). Use of a solving approach called "Unimodular Probing", combining constraint and linear programming.}}
}

%%% RIAS: Reactive methods. Solution reuse

@article{Freeman90a,
     AUTHOR = {B. Freeman-Benson and J. Maloney and A. Borning},  
     TITLE = {An {I}ncremental {C}onstraint {S}olver},  
     JOURNAL = {Communications of the ACM}, 
     VOLUME =  33,  
     NUMBER =  1,  
     PAGES = {54-63},  
     YEAR =  1990,
     KIND = {RIAS},
     NOTE = {{\bf Maintenance of solutions in dynamic constraint satisfaction problems, where changes are limited to changes of values for some variables. DeltaBlue algorithm. Limited to acyclic constraint networks involving only functional (also called "Dataflow") constraints}}
}


@article{Sannella93a,
     AUTHOR = {M. Sannella and J. Maloney and B. Freeman-Benson and A. Borning},  
     TITLE = {\htmladdnormallink
             {Multi-way versus {O}ne-way {C}onstraints in {U}ser {I}nterfaces: {E}xperience with the {D}elta{B}lue {A}lgorithm}{http://www.cs.washington.edu/research/constraints/solvers/spe-deltablue-93.html}},  
     JOURNAL = {Software: Practice and Experience}, 
     VOLUME =  23,  
     NUMBER =  5,  
     PAGES = {529-566},  
     YEAR =  1993,
     KIND = {RIAS},
     NOTE = {{\bf Extension of the DeltaBlue algorithm to the management of multi-way constraints: functional (dataflow) n-ary constraints with multiple output variables.}}
}

@inproceedings{Sannella93b,
     AUTHOR = {M. Sannella},  
     TITLE = {\htmladdnormallink
             {The {S}ky{B}lue {C}onstraint {S}olver and {I}ts {A}pplications}{http://www.cs.washington.edu/research/constraints/solvers/skyblue-ppcp-93.html}}, 
     BOOKTITLE = PPCP93P,
     ADDRESS = PPCP93L,
     YEAR =  1993,
     KIND = {RIAS},
     NOTE = {{\bf From DeltaBlue to SkyBlue: management of cycles in the constraint graph.}}
}

@article{Borning98a,
     AUTHOR = {A. Borning and B. Freeman-Benson}, 
     TITLE  = {\htmladdnormallink
             {Ultraviolet: {A} {C}onstraint {S}atisfaction {A}lgorithm for {I}nteractive {G}raphics}{http://citeseer.nj.nec.com/borning98ultraviolet.html}},    
     JOURNAL =  CO,  
     VOLUME =  3,
     NUMBER = 1,  
     PAGES = {9-32},  
     YEAR =  1998,
     KIND = {RIAS},
     NOTE = {{\bf From DeltaBlue and SkyBlue to Ultraviolet: management of cycles in the constraint graph and of non functional constraints.}}
}

@inproceedings{Trombettoni98a,
     AUTHOR = {G. Trombettoni},
     TITLE = {A {P}olynomial {T}ime {L}ocal {P}ropagation {A}lgorithm for {G}eneral {D}ataflow {C}onstraint {P}roblems},  
     BOOKTITLE = CP98P, 
     ADDRESS =  CP98L,  
     PAGES = {432-446},  
     YEAR = 1998,
     KIND = {RIAS},
     NOTE = {{\bf Maintenance of solutions in dynamic constraint satisfaction problems in the context of functional (dataflow) constraints: how to deal with cycles in the constraint graph.}}
}

@inproceedings{Trombettoni01a,
     AUTHOR = {G. Trombettoni and B. Neveu},  
     TITLE = {\htmladdnormallink
             {Links for {B}oosting {P}redictable {I}nteractive {C}onstraint {S}ystems}{ftp://ftp-sop.inria.fr/coprin/neveu/articles/cp01.ps.gz}}, 
     BOOKTITLE = {Proc.\  of the CP-01 Workshop on "User Interaction in Constraint Satisfaction"}, 
     ADDRESS =  CP01L,
     YEAR =  2001,
     KIND = {RIAS},
     NOTE = {{\bf Maintenance of solutions in dynamic constraint satisfaction problems in the context of functional (dataflow) constraints: how to specify the way of repairing a constraint among several possible ways.}} 
}

@inproceedings{Verfaillie94a,
     AUTHOR = {G. Verfaillie and T. Schiex},  
     TITLE = "\htmladdnormallink
             {Solution {R}euse in {D}ynamic {C}onstraint
          {S}atisfaction {P}roblems}
             {http://citeseer.nj.nec.com/verfaillie94solution.html}",   
     BOOKTITLE =  AAAI94P,  
     ADDRESS =  AAAI94L, 
     PAGES = {307-312}, 
     YEAR =  1994,
     KIND = {RIAS},
     NOTE = {{\bf Description of a complete algorithm (Local Changes) dedicated to the maintenance of solutions in dynamic constraint satisfaction problems.}}
}

@article{Miguel00a,
     AUTHOR = {I. Miguel and Q. Shen},  
     TITLE = {\htmladdnormallink
             {Dynamic {F}lexible {C}onstraint {S}atisfaction}{http://www-users.cs.york.ac.uk/~ianm/docs/AppliedInt.ps.gz}},  
     JOURNAL =  {Applied Intelligence},  
     VOLUME =  13,
     NUMBER = 3, 
     PAGES = {231-245},  
     YEAR =  2000,
     KIND = {RIAS},
     NOTE = {{\bf Soft and dynamic constraint satisfaction problem solving. Extension of the LC algorithm (Local Changes) to the management of fuzzy constraints (max aggregation operator), resulting in the FLC algorithm (Flexible Local Changes). Combination of this extension with fuzzy constraint propagation.}}
}

@article{Miguel01a,
     AUTHOR = {I. Miguel and Q. Shen and P. Jarvis},  
     TITLE = {\htmladdnormallink
             {Efficient {F}lexible {P}lanning via {D}ynamic {F}lexible {C}onstraint {S}atisfaction}{http://www-users.cs.york.ac.uk/~ianm/docs/EAAI.ps.gz}},  
     JOURNAL =  {Engineering Applications of Artificial Intelligence},  
     VOLUME =  14,
     NUMBER = 3, 
     PAGES = {301-327},  
     YEAR =  2001,
     KIND = {RIAS},
     NOTE = {{\bf Application of the techniques developed for solving soft and dynamic constraint satisfaction problems to the classical planning problem (Strips modelling). Use of the FLC algorithm to search for a plan in the graph created by the preprocessing phase of a Graphplan-like method.}}
}

@article{Miguel03a,
     AUTHOR = {I. Miguel and Q. Shen},  
     TITLE = {\htmladdnormallink
             {Fuzzy rr{DFCSP} and {P}lanning}{http://www-users.cs.york.ac.uk/~ianm/docs/AIJ03.pdf}},  
     JOURNAL =  AI,  
     VOLUME =  148,
     NUMBER = {1-2}, 
     PAGES = {11-52},  
     YEAR =  2003,
     KIND = {RIAS},
     NOTE = {{\bf Extension and synthesis of the work presented in the previous paper.}}
}

@inproceedings{Minton90a,
     AUTHOR = {S. Minton and M. Johnston and A. Philips and P. Laird},
          
     TITLE = {Solving {L}arge-{S}cale {C}onstraint {S}atisfaction and
          {S}cheduling {P}roblems {U}sing a {H}euristic
          {R}epair {M}ethod},   
     BOOKTITLE =  AAAI90P,  
     ADDRESS =  AAAI90L,  
     PAGES = {17-24},  
     YEAR =  1990,
     KIND = {RIAS},
     NOTE = {{\bf How to solve a scheduling problem or, more generally, a constraint satisfaction problem, either static or dynamic, via either a complete or an incomplete search based on conflict repair.}} 
}

@incollection{Smith95a,
     AUTHOR = {S. Smith},
     TITLE = {\htmladdnormallink
             {Reactive {S}cheduling {S}ystems}{http://citeseer.nj.nec.com/smith94reactive.html}}, 
     BOOKTITLE = {Intelligent Scheduling Systems},
     PUBLISHER = {Kluwer},
     EDITOR = {D. Brown and W. Sherer},
     YEAR = 1995,
     KIND = {RIAS},
     NOTE = {{\bf View of scheduling as a dynamic reactive process whose objective is to maintain a feasible and optimal schedule when changes in the external world add or remove constraints. Scheduler based on a set of repair operators which allow any schedule to be modified until a feasible and near-optimal schedule is reached.}}
}

@incollection{Zweden94a,
     AUTHOR = {M. Zweden and B. Daun and E. Davis and M. Deale},
     TITLE = {Scheduling and {R}escheduling with {I}terative {R}epair}, 
     BOOKTITLE = {Intelligent Scheduling},
     PAGES = {241-256},
     PUBLISHER = {Morgan Kaufmann},
     EDITOR = {M. Zweden and M. Fox},
     YEAR = 1994,
     KIND = {RIAS},
     NOTE = {{\bf Similar view of scheduling as an iterative repair process.}}
}

@inproceedings{Chien00b,
     AUTHOR = {S. Chien and R. Knight and A. Stechert and R.Sherwood and G. Rabideau},   
     TITLE = {\htmladdnormallink
             {Using {I}terative {R}epair to {I}mprove the {R}esponsiveness of {P}lanning and {S}cheduling}{http://www-aig.jpl.nasa.gov/public/planning/papers/casper-aips2000.pdf}},  
     BOOKTITLE =  AIPS00P, 
     ADDRESS =  AIPS00L,
     YEAR =  2000,
     KIND = {RIAS},
     NOTE = {{\bf Presentation of the CASPER tool which is dedicated to continuous planning/scheduling with interleaving between planning/scheduling and execution and uses an iterative repair approach.}}
}

%%% RNAS: Reactive methods. Reasoning reuse

@inproceedings{Bessiere91a,
     AUTHOR = {C. Bessi{\`e}re},  
     TITLE = {Arc-{C}onsistency in {D}ynamic {C}onstraint
          {S}atisfaction {P}roblems},   
     BOOKTITLE =  AAAI91P,  
     ADDRESS =  AAAI91L,  
     PAGES = {221-226},  
     YEAR =  1991,
     KIND = {RNAS},
     NOTE = {{\bf Maintenance of the arc-consistency property in dynamic binary constraint satisfaction problems. DnAC4 algorithm based on AC4 and on the recording of value removal justifications.}}
}

@inproceedings{Bessiere92a,
     AUTHOR = {C. Bessi{\`e}re},  
     TITLE = {Arc-{C}onsistency for {N}on-{B}inary {D}ynamic {CSPs}},
     BOOKTITLE = ECAI92P,  
     ADDRESS = ECAI92L,
     PAGES = {23-27},  
     YEAR =  1992,
     KIND = {RNAS},
     NOTE = {{\bf Extension of the AAAI-91 paper to the general case of dynamic n-ary constraint satisfaction problems.}}
}

@inproceedings{Prosser89a,
     AUTHOR = {P. Prosser},  
     TITLE = {A {R}eactive {S}cheduling {A}gent},   
     BOOKTITLE =  IJCAI89P,  
     ADDRESS =  IJCAI89L,  
     PAGES = {1004-1009},  
     YEAR =  1989,
     KIND = {RNAS},
     NOTE = {{\bf View of a scheduling problem as a constraint satisfaction problem. Use of a constraint propagation mechanism equipped with a justification recording and handling mechanism, to cut the search when solving either static or dynamic problems.}}
}

@inproceedings{Prosser92a,
     AUTHOR = {P. Prosser and C. Conway and C. Muller},  
     TITLE = {A {D}istributed {C}onstraint {M}aintenance {S}ystem},  
     BOOKTITLE = Avignon92P,   
     ADDRESS = Avignon92L,   
     YEAR =  1992,
     PAGES = {221-231},
     KIND = {RNAS},
     NOTE = {{\bf Maintenance of the arc-consistency property in dynamic and distributed binary constraint satisfaction problems. Based on AC3 and on the recording of value removal justifications.}}
}

@inproceedings{Debruyne96a,
       AUTHOR = {R. Debruyne}, 
       TITLE = {\htmladdnormallink
             {Arc-{C}onsistency in {D}ynamic {CSP}s is no more {P}rohibitive}{http://debruyne.ifrance.com/debruyne/ictai96.pdf}}, 
       BOOKTITLE = ICTAI96P, 
       ADDRESS = ICTAI96L,
       PAGES = {239-267},
       YEAR = 1996,
       KIND = {RNAS},
       NOTE = {{\bf Maintenance of the arc-consistency property in dynamic binary constraint satisfaction problems. DnAC6 algorithm based on AC6 and on the recording of value removal justifications.}} 
} 

@inproceedings{Berlandier94a,
     AUTHOR = {P. Berlandier and B. Neveu},  
     TITLE = {\htmladdnormallink
             {Arc-{C}onsistency for {D}ynamic {C}onstraint
          {S}atisfaction {P}roblems: a {RMS} free approach}{ftp://ftp-sop.inria.fr/coprin/neveu/contraintes/neveu/ecai94.ps.gz}},
     BOOKTITLE = {Proc.\  of the ECAI-94 Workshop on "Constraint
          Satisfaction Issues Raised by Practical
          Applications"}, 
     ADDRESS =  ECAI94L, 
     YEAR =  1994,
     KIND = {RNAS},
     NOTE = {{\bf Maintenance of the arc-consistency property in dynamic binary constraint satisfaction problems. AC|DC algorithm based on AC3, using no value removal justifications.}} 
}

@article{Debruyne95a,
     AUTHOR = {R. Debruyne},  
     TITLE = {\htmladdnormallink
             {Les algorithmes d'arc-consistance dans les {CSP} dynamiques}{http://debruyne.ifrance.com/debruyne/ria95.pdf}}, 
     JOURNAL = RIA,
     VOLUME = 9,
     NUMBER = 3,
     PAGES = {239-267},
     YEAR =  1995,
     KIND = {RNAS},
     NOTE = {{\bf Synthesis of the different ways of maintaining the arc-consistency property in dynamic constraint satisfaction problems. Comparison of the DnAC4, DnAC6, and AC|DC algorithms. In French.}}
}

@article{Schiex94d,
     AUTHOR = {T. Schiex and G. Verfaillie},  
     TITLE = "\htmladdnormallink
             {Nogood {R}ecording for {S}tatic and {D}ynamic
          {C}onstraint {S}atisfaction {P}roblems}
             {http://citeseer.nj.nec.com/schiex93nogood.html}",
     JOURNAL = IJAIT,
     VOLUME = 3,
     NUMBER = 2,
     PAGES = {187-207}, 
     YEAR =  1994,
     KIND = {RNAS},
     NOTE = {{\bf Method based on the production, recording and reuse of nogoods to boost the solving of either static or dynamic constraint satisfaction problems.}}
}

@article{Fages98a,
     AUTHOR = {F. Fages and J. Fowler and T. Sola}, 
     TITLE  = {Experiments in {R}eactive {C}onstraint {L}ogic {P}rogramming},
     JOURNAL =  {Journal of Logic Programming},  
     VOLUME =  37,
     NUMBER = {1-3},
     PAGES = {185-212},
     YEAR =  1998,
     KIND = {RNAS},
     NOTE = {{\bf Design of a reactive constraint logic programming system, which supports both constraint addition and removal. Approach based on the recording and maintenance of justifications.}}
}

@article{Georget99a,
     AUTHOR = {Y. Georget and P. Codognet and F. Rossi}, 
     TITLE  = {\htmladdnormallink
             {Constraint {R}etraction in {CLP(FD)}: {F}ormal {F}ramework and {P}erformance {R}esults}{http://contraintes.inria.fr/~georget/publications/constraints.ps.zip}},    
     JOURNAL =  CO,  
     VOLUME =  4,
     NUMBER = 1,
     KIND = {RNAS},
     YEAR =  1999,
     NOTE = {{\bf How to maintain the arc-consistency property in case of constraint removal in the context of Constraint Logic Programming, by using no value removal justifications, but only information about the constraint graph.}}
}

@inproceedings{Wolf98a,
     AUTHOR = {A. Wolf and T. Gruenhagen and U. Geske}, 
     TITLE = {\htmladdnormallink
             {On {I}ncremental {A}daptation of {C}onstraint {H}andling {R}ule {D}erivations after {C}onstraint {D}eletions}{http://citeseer.nj.nec.com/wolf97incremental.html}},  
     BOOKTITLE =  {Proc.\ of the Joint Workshop of the ERCIM Working Group on Constraints and of the CompulogNet area on Constraint Programming},   
     ADDRESS =  {Amsterdam, The Netherlands},  
     YEAR =  1998,
     KIND = {RNAS},
     NOTE = {{\bf Adaptation of the "Constraint Handling Rules" system (CHR) to a dynamic setting where constraint deletions are possible as well as constraint additions.}}
}

@inproceedings{Jussien97b,
     AUTHOR = {N. Jussien and P. Boizumault},  
     TITLE = {\htmladdnormallink
             {Best-first {S}earch for {P}roperty {M}aintenance in {R}eactive {C}onstraint {S}ystems}{http://citeseer.nj.nec.com/jussien97bestfirst.html}},
     BOOKTITLE = {Proc.\ of the International Logic Programming Symposium}, 
     ADDRESS =  {Port Jefferson, NY, USA},
     PAGES= {339-353},
     YEAR =  1997,
     KIND = {RNAS},
     NOTE = {{\bf Justification-based approach for dealing with dynamic over-constrained constraint satisfaction problems}}
}

@inproceedings{Jussien00a,
     AUTHOR = {N. Jussien and R. Debruyne and P. Boizumault},  
     TITLE = {\htmladdnormallink
             {Maintaining {A}rc-{C}onsistency within {D}ynamic {B}acktracking}{http://citeseer.nj.nec.com/jussien00maintaining.html}},
     BOOKTITLE = CP00P, 
     ADDRESS =  CP00L, 
     PAGES = {249-261},  
     YEAR =  2000,
     KIND = {RNAS},
     NOTE = {{\bf How to improve the DBT algorithm (Dynamic Backtracking) with the use of arc-consistency, although this algorithm is no more a tree search, but a kind of local search in the space of incomplete assignments.}}
}

@article{Jussien02a,
     AUTHOR = {N. Jussien and O. Lhomme},  
     TITLE = {\htmladdnormallink
             {Local {S}earch with {C}onstraint {P}ropagation and {C}onflict-based {H}euristics}{http://citeseer.nj.nec.com/jussien02local.html}},
     JOURNAL =  AI,  
     VOLUME =  139,
     PAGES = {21-45},  
     YEAR =  2002,
     KIND = {RNAS},
     NOTE = {{\bf Combination between local search and constraint propagation in the context of a local search in the space of incomplete assignments. View of this local search as a dynamic constraint satisfaction problem.}}
}

@inproceedings{Debruyne03a,
     AUTHOR = {R. Debruyne and G. Ferrand and N. Jussien and W. Lesaint and S. Ouis and A. Tessier},  
     TITLE = {\htmladdnormallink
             {Correctness of {C}onstraint {R}etraction {A}lgorithms}{http://www.emn.fr/jussien/publications/debruyne-FLAIRS03.pdf}},
     BOOKTITLE = {Proc.\ of the 16th International Florida Artificial Intelligence Research Society Conference (FLAIRS-03)}, 
     ADDRESS =  {St. Augustine, FL, USA}, 
     YEAR =  2003,
     KIND = {RNAS},
     NOTE = {{\bf General scheme for constraint retraction algorithms using explanations. Necessary conditions for algorithm correctness.}}
}

@inproceedings{Elkhyari01a,
     AUTHOR = {A. Elkhyari and C. Gu{\'e}ret and N. Jussien},   
     TITLE = {\htmladdnormallink
             {Conflict-based {R}epair {T}echniques for {S}olving {D}ynamic {S}cheduling {P}roblems}{http://www.emn.fr/jussien/publications/elkhyari-CP02.pdf}}, 
     BOOKTITLE =  CP02P, 
     ADDRESS =  CP02L, 
     YEAR =  2002,
     KIND = {RNAS},
     NOTE = {{\bf Application of the justification-based techniques used for dealing with dynamic constraint satisfaction problems to the solving of dynamic scheduling problems.}}
}

%%% RSS: Reactive methods. Solution and reasoning reuse

@article{VanHentenryck91a,
     AUTHOR = {P. Van Hentenryck and T. Le Provost},  
     TITLE = {\htmladdnormallink
             {Incremental {S}earch in {C}onstraint {L}ogic
          {P}rogramming}{http://www.cs.brown.edu/people/pvh/isearch.ps}},   
     JOURNAL = {New Generation Computing},  
     VOLUME =  9,  
     PAGES = {257-275},  
     YEAR =  1991,
     KIND = {RSS},
     NOTE = {{\bf Solution and reasoning reuse for solving a sequence of constraint satisfaction problems. When solving a problem, recording of the first solution found and of the fact that no solution exists before it in the search tree.}}
}

@inproceedings{Verfaillie94b,
     AUTHOR = {G. Verfaillie and T. Schiex},  
     TITLE = "\htmladdnormallink
             {Dynamic {B}acktracking for {D}ynamic {C}onstraint
          {S}atisfaction {P}roblems}
             {ftp://ftp.cert.fr/pub/verfaillie/ecai94g.ps}", 
     BOOKTITLE = {Proc.\ of the ECAI-94 Workshop on "Constraint
          Satisfaction Issues Raised by Practical
          Applications"}, 
     ADDRESS =  ECAI94L, 
     YEAR =  1994,
     KIND = {RSS},
     NOTE = {{\bf Description of an extension of the DBT algorithm (Dynamic Backtracking) for the  maintenance of solutions in dynamic constraint satisfaction problems. Combination of solution and reasoning reuse}}
}

@article{Verfaillie95c,
     AUTHOR = {G. Verfaillie and T. Schiex},  
     TITLE = "\htmladdnormallink
             {Maintien de solution dans les probl{\`e}mes dynamiques
          de satisfaction de contraintes: bilan de quelques
          approches}
             {ftp://ftp.cert.fr/pub/verfaillie/dyn-ria.ps}", 
     JOURNAL = RIA,
     VOLUME = 9,
     NUMBER = 3,
     PAGES = {269-309},
     YEAR =  1995,
     KIND = {RSS},
     NOTE = {{\bf Synthesis of several algorithms based on either solution or reasoning reuse for the maintenance of solutions in dynamic constraint satisfaction problems. Algorithm descriptions. Experiment results. In French.}}
}

@inproceedings{Purvis97a,
     AUTHOR = {L. Purvis},
     TITLE = {\htmladdnormallink
             {Dynamic {C}onstraint {S}atisfaction using {C}ase-{B}ased {R}easoning {T}echniques}{http://citeseer.nj.nec.com/155808.html}},   
     BOOKTITLE = {Proc.\  of the CP-97 Workshop on "Theory and Practice of Dynamic Constraint Satisfaction"}, 
     ADDRESS =  CP97L,
     YEAR =  1997,
     KIND = {RSS},
     NOTE = {{\bf Discussion about the possible use of case-based reasoning techniques for solving dynamic constraint satisfaction problems.}} 
}

%%% MISA: Proactive methods. Search for robust solutions

@inproceedings{Fargier93b,
     AUTHOR = {H. Fargier and J. Lang},  
     TITLE = {Uncertainty in {C}onstraint {S}atisfaction {P}roblems: {A} {P}robabilistic {A}pproach},
     BOOKTITLE =  ECSQARU93P,
     ADDRESS =  ECSQARU93L,
     PAGES = {97-104},
     YEAR =  1993,
     KIND = {MISA},
     NOTE = {{\bf Introduction to the so-called "Probabilistic Constraint Satisfaction Problem". In a Probabilistic CSP, constraints are not certain. A probability of presence in the real world is associated with each of them.}}
}

@inproceedings{Schiex95b,
     AUTHOR = {T. Schiex and H. Fargier and G. Verfaillie},  
     TITLE = "\htmladdnormallink
             {Valued {C}onstraint {S}atisfaction {P}roblems~: {H}ard
          and {E}asy {P}roblems}
             {ftp://ftp.cert.fr/pub/verfaillie/ijcai95.ps}",  
     BOOKTITLE =  IJCAI95P,
     ADDRESS =  IJCAI95L,
     PAGES = {631-637}, 
     YEAR =  1995,
     KIND = {MISA},
     NOTE = {{\bf The probabilistic constraint satisfaction problem as a special case of "Valued Constraint Satisfaction Problem" (VCSP).}}
}

@inproceedings{Schiex96b,
    AUTHOR = {H. Fargier and J. Lang and T. Schiex}, 
    TITLE  = {Mixed {C}onstraint {S}atisfaction: a {F}ramework for
          {D}ecision {P}roblems under {I}ncomplete
          {K}nowledge},    
    BOOKTITLE = AAAI96P, 
        ADDRESS = AAAI96L, 
        PAGES = {175-180}, 
    YEAR = 1996,
        KIND = {MISA},
        NOTE = {{\bf Introduction to the so-called "Mixed Constraint Satisfaction Problem". In a Mixed CSP, variables are of two types: decision and non-decision variables. The first ones are controllable by the decision system. The second ones are uncontrollable or, in other words, controllable by the "external world" (environment, user, other decision systems~\ldots).}}
}

@inproceedings{Wallace98b,
     AUTHOR = {R. Wallace and E. Freuder},  
     TITLE = {\htmladdnormallink
             {Stable {S}olutions for {D}ynamic {C}onstraint {S}atisfaction {P}roblems}{http://citeseer.nj.nec.com/wallace98stable.html}},
     BOOKTITLE =  CP98P,  
     ADDRESS =  CP98L, 
     PAGES = {447-461}, 
     YEAR =  1998,
     KIND = {MISA},
     NOTE = {{\bf Search for so-called "Stable Solutions", i.e. solutions which resist as best as possible temporary changes which may appear in dynamic "Recurrent Constraint Satisfaction Problems": temporary loss of either values or combination of values. Non probabilistic approach. Penalization of the least robust values or combinations of values.}}
}

@inproceedings{Fowler00b,
     AUTHOR = {D. Fowler and K. Brown},  
     TITLE = {\htmladdnormallink
             {Branching {C}onstraint {S}atisfaction {P}roblems for {S}olutions {R}obust under {L}ikely {C}hanges}{http://citeseer.nj.nec.com/fowler00branching.html}}, 
     BOOKTITLE = CP00P, 
     ADDRESS =  CP00L,
     YEAR =  2000,
     KIND = {MISA},
     NOTE = {{\bf Introduction to the so-called "Branching Constraint Satisfaction Problem". In a Branching CSP, variables may be added according to some probability. The objective is to make the most robust decisions, by taking into account the possible variable additions. The objective function is the sum of the utilities of the assigned variables.}} 
}

@article{Fowler03a,
     AUTHOR = {D. Fowler and K. Brown},  
     TITLE = {Branching {C}onstraint {S}atisfaction {P}roblems and {M}arkov {D}ecision {P}roblems {C}ompared},
     JOURNAL =  {Annals of Operations Research},  
     VOLUME =  118,
     NUMBER = {1-4},
     PAGES = {85-100},  
     YEAR =  2003,
     KIND = {MISA},
     NOTE = {{\bf Comparison between a CSP approach and an MDP one (Markov Decision Processes) for solving branching constraint satisfaction problems.}} 
}

@inproceedings{Davenport01a,
     author = {A. Davenport and C. Gefflot and C. Beck},
     title = {Slack-based {T}echniques for {R}obust {S}chedules}, 
     booktitle = ECP01P,
     address = ECP01L,
     year = {2001},
     KIND = {MISA},
     NOTE = {{\bf Search for robust solutions in scheduling problems with uncertainty on actual activity durations. Addition of a sensible extra time to each activity in order to be able to absorb increases in activity durations without rescheduling.}}
}

@inproceedings{Branke02a,
     AUTHOR = {J. Branke and D. Mattfeld},  
     TITLE = {Anticipatory {S}cheduling for {D}ynamic {J}ob {S}hop {P}roblems}, 
     BOOKTITLE = {Proc.\  of the AIPS-02 Workshop on "Online Planning and Scheduling"}, 
     ADDRESS =  AIPS02L,
     YEAR =  2002,
     KIND = {MISA},
     NOTE = {{\bf How to anticipate future changes when building a schedule by modifying the optimization criterion.}}
}

@article{Littman01a,
     AUTHOR = {M. Littman and S. Majercik and T. Pitassi},  
     TITLE = {\htmladdnormallink
             {Stochastic {B}oolean {S}atisfiability}{http://citeseer.nj.nec.com/littman00stochastic.html}}, 
     JOURNAL =  {Journal of Automated Reasoning},  
     VOLUME =  27,
     NUMBER = 3,
     PAGES = {251-296},  
     YEAR =  2001,
     KIND = {MISA},
     NOTE = {{\bf Study of the so-called "Stochastic Boolean Satisfiability Problem" (SSAT), which involves three types of variables: existential, universal, and randomized. Links with planning under uncertainty. Complexity results. Presentation of two kinds of algorithms: a complete DP-like tree search (Davis \& Putman) involving unit resolution, purification, and thresholding, and an incomplete stochastic sampling search.}}
} 

@inproceedings{Walsh02a,
     AUTHOR = {T. Walsh},
     TITLE = {\htmladdnormallink
             {Stochastic {C}onstraint {P}rogramming}{http://citeseer.nj.nec.com/walsh01stochastic.html}}, 
     BOOKTITLE = ECAI02P,
     ADDRESS = ECAI02L,
     YEAR = {2002},
     KIND = {MISA},
     NOTE = {{\bf Introduction of the so-called "Stochastic Constraint Satisfaction Problem". In a Stochastic CSP, variables are of two types: decision and stochastic variables. Problem complexity. Description of a tree search algorithm with forward checking.}}
}

@inproceedings{Manandhar03a,
     AUTHOR = {S. Manandhar and A. Tarim and T. Walsh},  
     TITLE = {\htmladdnormallink
             {Scenario-based {S}tochastic {C}onstraint {P}rogramming}{http://citeseer.nj.nec.com/567028.html}}, 
     BOOKTITLE = IJCAI03P, 
     ADDRESS =  IJCAI03L, 
     YEAR =  2003,
     KIND = {MISA},
     NOTE = {{\bf Scenario-based approach for solving stochastic constraint satisfaction problems.}}
}

@inproceedings{Yorke03a,
     AUTHOR = {N. Yorke-Smith and C. Gervet},  
     TITLE = {Certainty {C}losure: A {F}ramework for {R}eliable {C}onstraint {R}easoning with {U}ncertainty}, 
     BOOKTITLE = CP03P, 
     ADDRESS =  CP03L,
     YEAR =  2003,
     KIND = {MISA},
     NOTE = {{\bf Given a CSP which involves a set of uncertain parameters, either to define or to bound the so-called "Certainty Closure" i.e., the set of all the possible solutions, which are solutions for at least one combination of values of the uncertain parameters. Note the difference with robust solutions, which must be solutions for all the possible combinations of the uncertain parameters or at least most of them.}}
}

%%% MNSA: Proactive methods. Search for flexible solutions

@inproceedings{Jegou94a,
     AUTHOR = {P. J{\'e}gou},  
     TITLE = {A {L}ogical {A}pproach to {S}olve {D}ynamic {CSP}s:
          {P}reliminary {R}eport},
     BOOKTITLE = {Proc.\ of the ECAI94 Workshop on "Constraint
          Satisfaction Issues Raised by Practical
          Applications"}, 
     ADDRESS =  ECAI94L, 
     YEAR =  1994,
     KIND = {MNSA},
     NOTE = {{\bf Use of a BDD-like representation (Binary Decision Diagrams) to represent compactly all the solutions of a dynamic constraint satisfaction problem.}}
}

@article{Amilhastre02a,
     AUTHOR = {J. Amilhastre and H. Fargier and P. Marquis},  
     TITLE = {Consistency {R}estoration and {E}xplanations in {D}ynamic {CSP}: {A}pplication to {C}onfiguration},  
     JOURNAL =  AI,  
     VOLUME =  135,
     NUMBER = 1,  
     PAGES = {199-234},  
     YEAR =  2002,
     KIND = {MNSA},
     NOTE = {{\bf Use of an ATMS approach (Assumption-based Truth Maintenance System) to deal with the dynamic CSP which results from the interactive solving of a configuration problem. Use of a automaton to represent compactly all its solutions offline.}}
}

@inproceedings{Lesaint94a,
     AUTHOR = {D. Lesaint},  
     TITLE = "Maximal {S}ets of {S}olutions for {C}onstraint
          {S}atisfaction {P}roblems",  
     BOOKTITLE = ECAI94P, 
     ADDRESS =  ECAI94L,  
     PAGES = {110,114},  
     YEAR =  1994,
     KIND = {MNSA},
     NOTE = {{\bf Computation of sets of solutions which can be represented as a cartesian product of subdomains of all the variable domains.}}
}

@inproceedings{Ginsberg98a,
     AUTHOR = {M. Ginsberg and A. Parkes and A. Roy},  
     TITLE = {\htmladdnormallink
             {Supermodels and {R}obustness}{http://citeseer.nj.nec.com/ginsberg98supermodels.html}},   
     BOOKTITLE =  AAAI98P,  
     ADDRESS =  AAAI98L,  
     PAGES = {334-339},  
     YEAR =  1998,
     KIND = {MNSA},
     NOTE = {{\bf Search for so-called "Supermodels" i.e., solutions which, in case of a limited change (change of value for a limited number of variables), can recover consistency by performing a limited change too (change of value for a limited number of variables, different from the first). Study in the context of the SAT problem.}}
}

@inproceedings{Hebrard03a,
     AUTHOR = {E. Hebrard and B. Hnich and T. Walsh}, 
     TITLE = {\htmladdnormallink
             {Super {CSP}s}{http://www.4c.ucc.ie/~ehebrard/stuff/nscsp.pdf}},   
     BOOKTITLE =  {Proc.\ of the CP-03 Workshop on "Handling Change and Uncertainty"},   
     ADDRESS =  CP03L,  
     YEAR =  2003,
     KIND = {MNSA},
     NOTE = {{\bf Extension of the notion of supermodel to the CSP framework. Introduction of the notion of superconsistency. Algorithms for producing supersolutions.}}
}

@inproceedings{Drummond94b,
     AUTHOR = {M. Drummond and J. Bresina and K. Swanson},  
     TITLE = {\htmladdnormallink
             {Just-{I}n-{C}ase Scheduling}{http://citeseer.nj.nec.com/11454.html}},   
     BOOKTITLE =  AAAI94P,  
     ADDRESS =  AAAI94L, 
     PAGES = {1098-1104}, 
     YEAR =  1994,
     KIND = {MNSA},
     NOTE = {{\bf Off-line anytime computing of contingent schedules to take into account the most probable schedule breaks due to uncertainty about actual action duration.}}
}

@article{Vidal99a,
     AUTHOR = {T. Vidal and H. Fargier},  
     TITLE = {\htmladdnormallink
             {Handling {C}ontingency in {T}emporal {C}onstraint {N}etworks: {F}rom {C}onsistency to {C}ontrollabilities}{http://citeseer.nj.nec.com/vidal98handling.html}},  
     JOURNAL = JETAI,  
     VOLUME = {11},  
     NUMBER = {1},  
     PAGES = {23-45},  
     YEAR =  1999,
     KIND = {MNSA},
     NOTE = {{\bf Introduction to the so-called "Simple Temporal Problem with Uncertainty" (STPU), an extension of the "Simple Temporal Problem" (STP), where some constraints may be uncontrollable (or contingent). In such a setting, the classical consistency property must be redefined in terms of controllability. Definition of three levels of controllability: weak, strong, and dynamic. Associated checking algorithms. Complexity results.}}
}

@inproceedings{Morris99a,
     AUTHOR = {P. Morris and N. Muscettola},  
     TITLE = {Managing {T}emporal {U}ncertainty {T}hrough {W}aypoint {C}ontrollability},
     BOOKTITLE =  IJCAI99P,
     ADDRESS =  IJCAI99L,
     PAGES = {1253-1258},
     YEAR =  1999,
     KIND = {MNSA},
     NOTE = {{\bf In the STPU framework, introduction of the waypoint controllability which generalizes weak and strong controllabilities.}}
}

@inproceedings{Vidal00a,
     AUTHOR = {T. Vidal},  
     TITLE = {Controllability {C}haracterization and {C}hecking in {C}ontingent {T}emporal {C}onstraint {N}etworks},   
     BOOKTITLE =  KR00P,  
     ADDRESS =  KR00L, 
     YEAR =  2000,
     KIND = {MNSA},
     NOTE = {{\bf Extension of the previous works on STPUs. Modelling of a STPU as a "Timed Game Automaton".}}
}

@inproceedings{Vidal00b,
     AUTHOR = {T. Vidal},  
     TITLE = {A {U}nified {D}ynamic {A}pproach for {D}ealing with {T}emporal {U}ncertainty and {C}onditional {P}lanning},   
     BOOKTITLE =  AIPS00P,  
     ADDRESS =  AIPS00L, 
     YEAR =  2000,
     KIND = {MNSA},
     NOTE = {{\bf Extension of the previous works on STPUs. Applicability in the context of conditional and reactive planning.}}
}

@inproceedings{Morris01a,
     AUTHOR = {P. Morris and N. Muscettola and T. Vidal},  
     TITLE = {Dynamic {C}ontrol of {P}lans with {T}emporal {U}ncertainty},
     BOOKTITLE =  IJCAI01P,
     ADDRESS =  IJCAI01L,
     PAGES = {494-499},
     YEAR =  2001,
     KIND = {MNSA},
     NOTE = {{\bf In the STPU framework, proof that the most practically interesting controllability property, the dynamic one, can be checked in polynomial time. Description of the associated algorithm.}}
}

@inproceedings{Vidal01a,
     AUTHOR = {T. Vidal and J. Bidot},  
     TITLE = {\htmladdnormallink
             {Dynamic {S}equencing of {T}asks in {S}imple {T}emporal {N}etworks with {U}ncertainty}{http://www.csd.abdn.ac.uk/~kbrown/CP2001Uncertainty/Final/vidal.pdf}}, 
     BOOKTITLE = {Proc.\  of the CP-01 Workshop on "Constraints and Uncertainty"}, 
     ADDRESS =  CP01L,
     YEAR =  2001,
     KIND = {MNSA},
     NOTE = {{\bf Extension of the schedule flexibility to sequencing decisions}} 
}

@inproceedings{Muscettola98b,
     AUTHOR = {N. Muscettola and P. Morris and I. Tsamardinos},  
     TITLE = {\htmladdnormallink
             {Reformulating {T}emporal {P}lans for {E}fficient {E}xecution}{http://citeseer.nj.nec.com/muscettola98reformulating.html}},
     BOOKTITLE = KR98P, 
     ADDRESS = KR98L,
     PAGES = {444-452}, 
     YEAR =  1998,
     KIND = {MNSA},
     NOTE = {{\bf Link between planning and execution. Introduction of the notion of "Dispatchability": a simple temporal network (STP) is dispatchable if it can be executed by the execution module, which is equipped with specified propagation algorithms, without violating any constraint.}}
}

@inproceedings{Morris00a,
     AUTHOR = {P. Morris and N. Muscettola},  
     TITLE = {\htmladdnormallink
             {Execution of {T}emporal {P}lans with {U}ncertainty}{http://citeseer.nj.nec.com/morris00execution.html}},
     BOOKTITLE =  AAAI00P,
     ADDRESS =  AAAI00L,
     PAGES = {491-496},
     YEAR =  2000,
     KIND = {MNSA},
     NOTE = {{\bf Extension of previous works on dispatchability to the STPU framework.}}
}

@inproceedings{Wallace00a,
     AUTHOR = {R. Wallace and E. Freuder},
     TITLE = {\htmladdnormallink
             {Dispatchability {C}onditions for {S}chedules with {C}onsumable {R}essources}{http://citeseer.nj.nec.com/382661.html}}, 
     BOOKTITLE = ECAI00P,
     ADDRESS = ECAI00L,
     PAGES = {526-539}, 
     YEAR = 2000,
     KIND = {MNSA},
     NOTE = {{\bf Extension of previous works on dispatchability to take into account limited consumable resources in addition to temporal constraints.}}
}

@inproceedings{Muscettola02a,
     AUTHOR = {N. Muscettola},  
     TITLE = {Computing the {E}nvelope for {S}tepwise-{C}onstant {R}esource {A}llocation},
     BOOKTITLE = CP02P, 
     ADDRESS = CP02L,
     PAGES = {139-154}, 
     YEAR =  2002,
     KIND = {MNSA},
     NOTE = {{\bf How to compute bounds on the consumption of resources in the setting of a flexible schedule.}}
}

@inproceedings{Rossi03a,
     AUTHOR = {F. Rossi and B. Venable and N. Yorke-Smith}, 
     TITLE = {Preferences and {U}ncertainty in {S}imple {T}emporal {N}etworks},   
     BOOKTITLE =  {Proc.\ of the CP-03 Workshop on "Handling Change and Uncertainty"},   
     ADDRESS =  CP03L,  
     YEAR =  2003,
     KIND = {MNSA},
     NOTE = {{\bf Combination between two extensions of the STP framework for dealing with preferences as well as with uncertainty, resulting in the STPPU framework.}}
}

@inproceedings{Policella03a,
     AUTHOR = {N. Policella and S. Smith and A. Cesta and A. Oddi}, 
     TITLE = {Steps toward {C}omputing {F}lexible {S}chedules},   
     BOOKTITLE =  {Proc.\ of the CP-03 Workshop on "Handling Change and Uncertainty"},   
     ADDRESS =  CP03L,  
     YEAR =  2003,
     KIND = {MNSA},
     NOTE = {{\bf Objective: to maintain temporal flexibility as much as possible when planning, in the presence of time and resource constraints. Introduction of two measures of flexibility: fluidity and disruptability. Comparison between a resource envelope approach and a early start time one.}}
}

%%% MIADR: Applications

@inproceedings{Chiu96a,
     AUTHOR = {C. Chiu and C. Chou and J. Lee and H. Leung and Y. Leung},  
     TITLE = {\htmladdnormallink
             {A {C}onstraint-{B}ased {I}nteractive {T}rain {R}escheduling {T}ool}{http://citeseer.nj.nec.com/4105.html}}, 
     BOOKTITLE = CP96P, 
     ADDRESS =  CP96L, 
     PAGES = {104-118}, 
     YEAR =  1996,
     KIND = {MIADR},
     NOTE = {{\bf Dynamic scheduling with two objectives: to minimize the passenger delays and the number of station visit modifications in case of rescheduling.}}
}

@inproceedings{Benoist01a,
     AUTHOR = {T. Benoist and E. Bourreau and Y. Caseau and B. Rottembourg},
     TITLE = {\htmladdnormallink
             {Towards {S}tochastic {C}onstraint {P}rogramming: {A} {S}tudy of {O}nline {M}ulti-choice {K}napsack with {D}eadlines}{http://www.e-lab.bouygues.com/ADHOC/publications/CP01.pdf}}, 
     BOOKTITLE = CP01P,
     ADDRESS = CP01L,
     PAGES = {61-76},
     YEAR = {2001},
     KIND = {MIADR},
     NOTE = {{\bf Description of a problem of management of reservations by a tour operator, which has to face continuous changes in the user requests, as well as uncertainty about the future changes. Link with stochastic optimization.}}
}

@inproceedings{Marriot01a,
     AUTHOR = {K. Marriott and P. Moulder and P. Stuckey and A. Borning},
     TITLE = {\htmladdnormallink
             {Solving {D}isjunctive {C}onstraints for {I}nteractive {G}raphical {A}pplications}{http://citeseer.nj.nec.com/marriott01solving.html}}, 
     BOOKTITLE = CP01P,
     ADDRESS = CP01L,
     YEAR = {2001},
     KIND = {MIADR},
     NOTE = {{\bf Dynamic management of the disjunctions of linear inequalities which are associated with the non-overlap constraints in the context of interactive graphical applications}}
}

@inproceedings{Modi01a,
     AUTHOR = {P. Modi and H. Jung and M. Tambe and W. Shen and S. Kulkarni},
     TITLE = {\htmladdnormallink
             {A {D}ynamic {D}istributed {C}onstraint {S}atisfaction {A}pproach to {R}esource {A}llocation}{http://www-scf.usc.edu/~hyuckchj/job/publications/CP01.pdf}}, 
     BOOKTITLE = CP01P,
     ADDRESS = CP01L,
     PAGES = {685-700},
     YEAR = {2001},
     KIND = {MIADR},
     NOTE = {{\bf Presentation of a dynamic and distributed resource allocation problem. Introduction to the so-called "Dynamic Distributed Constraint Satisfaction Problem" (DyDCSP). Representation of the resource allocation problem as a DyDCSP. Solving of a DyDCSP using an AWC-like algorithm (Asynchronous Weak-Commitment).}}
}

@inproceedings{Lauvergne02a,
     AUTHOR = {M. Lauvergne and P. David and P. Boizumault},   
     TITLE = {Connections {R}eservation with {R}erouting for {ATM} {N}etworks: {A} {H}ybrid {A}pproach with {C}onstraints}, 
     BOOKTITLE =  CP02P, 
     ADDRESS =  CP02L, 
     PAGES = {649-663}, 
     YEAR =  2002,
     KIND = {MIADR},
     NOTE = {{\bf Dynamic connection reservation in the setting of the management of an ATM network, with an incremental arrival of new connection requests. Approach: limited local modification of the current solution.}}
}

@article{Qu02a,
     AUTHOR = {Y. Qu and S. Beale}, 
     TITLE  = {Cooperative {R}esolution of {O}ver-{C}onstrained {I}nformation {R}equests},    
     JOURNAL =  CO,  
     VOLUME =  7,
     PAGES = {29-47},
     YEAR =  2002,
     KIND = {MIADR},
     NOTE = {{\bf How to deal with the dynamic and over-constrained constraint satisfaction problems which appear in the context of information-seeking applications, involving user interaction.}}
}

%%% MNADR: Related work

@inproceedings{Fromherz94a,
     AUTHOR = {M. Fromherz and B. Carlson},  
     TITLE = {\htmladdnormallink
             {Optimal {I}ncremental and {A}nytime {S}cheduling}{http://www2.parc.com/spl/projects/mbc/publications/mbc-reactive-ilps94-abstract.html}},
     BOOKTITLE = {Proc.\ of the ILPS-94 Workshop on "Constraint Languages/Systems and their Use in Problem Modelling"}, 
     ADDRESS =  {Syracuse, NY, USA}, 
     YEAR =  1994,
     KIND = {MNADR},
     NOTE = {{\bf Use of constraint programming to deal with reactive applications, where information about the future is incomplete and only incrementally acquired, but successive decisions have to be made despite of this incomplete knowledge.}} 
}

@inproceedings{Fromherz97a,
     AUTHOR = {M. Fromherz and J. Conley},  
     TITLE = {\htmladdnormallink
             {Issues in {R}eactive {C}onstraint {S}olving}{http://www2.parc.com/spl/projects/mbc/publications/mbc-scheduling-cotic97-abstract.html}},
     BOOKTITLE = {Proc.\ of the CP-97 Workshop on "Concurrent Constraint Programming for Time-Critical Applications"}, 
     ADDRESS =  CP97L, 
     YEAR =  1997,
     KIND = {MNADR},
     NOTE = {{\bf Design of a reactive constraint solver, able to react continuously with its environment, at a rate controlled by this environment and with only incomplete knowledge of the future evolution of this environment.}} 
}

@incollection{Menezes96c,
     AUTHOR = {F. Menezes and P. Barahona}, 
     TITLE = {Defeasible {C}onstraint {S}olving},
     BOOKTITLE = {Over-Constrained Systems (LNCS 1106, Selected papers
                  from the Workshop on Over-Constrained Systems at
                  CP-95, reprints and background papers)},   
     PUBLISHER = {Springer},
     EDITOR = {M. Jampel and E. Freuder and M. Maher},
     PAGES = {151-170},
     YEAR =  1996,
     KIND = {MNADR},
     NOTE = {{\bf An "Incremental Hierarchical Constraint Solver" for dealing with preferences as well as with constraint additions and removals}}
}

@inproceedings{Ringwelski02a,
     AUTHOR = {G. Ringwelski and H. Schlenker}, 
     TITLE = {\htmladdnormallink
             {Dynamic {D}istributed {C}onstraint {S}atisfaction with {A}synchronous {S}olvers}{http://citeseer.nj.nec.com/ringwelski02dynamic.html}},  
     BOOKTITLE =  {Proc.\ of the Joint Workshop of the ERCIM Working Group on Constraints and of the CologNet area on Constraint and Logic Programming},   
     ADDRESS =  {Cork, Ireland},  
     YEAR =  2002,
     KIND = {MNADR},
     NOTE = {{\bf Use of the so-called "Asynchronous Constraint Solving" execution model for dealing with dynamic and distributed constraint satisfaction problems. Work in progress.}}
}