## Solution Reuse in Dynamic Constraint Satisfaction Problems (1994)

### Cached

### Download Links

- [www.aaai.org]
- [www.aaai.org]
- [ftp.cert.fr]
- DBLP

### Other Repositories/Bibliography

Citations: | 86 - 6 self |

### BibTeX

@INPROCEEDINGS{Verfaillie94solutionreuse,

author = {Gérard Verfaillie and Thomas Schiex},

title = {Solution Reuse in Dynamic Constraint Satisfaction Problems},

booktitle = {},

year = {1994},

pages = {307--312}

}

### Years of Citing Articles

### OpenURL

### Abstract

Many AI problems can be modeled as constraint satisfaction problems (CSP), but many of them are actually dynamic: the set of constraints to consider evolves because of the environment, the user or other agents in the framework of a distributed system. In this context, computing a new solution from scratch after each problem change is possible, but has two important drawbacks: inefficiency and instability of the successive solutions. In this paper, we propose a method for reusing any previous solution and producing a new one by local changes on the previous one. First we give the key idea and the corresponding algorithm. Then we establish its properties: termination, correctness and completeness. We show how it can be used to produce a solution, either from an empty assignment, or from any previous assignment and how it can be improved using filtering or learning methods, such as forward-checking or nogoodrecording. Experimental results related to efficiency and stability are given, wit...

### Citations

577 | Where the really hard problems are - Cheeseman, Kanefsky, et al. - 1991 |

397 | P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Minton, Johnston, et al.
- 1992
(Show Context)
Citation Context ...hods, which consist of starting from any previous consistent assignment (complete or not) and of repairing it, using a sequence of local modifications (modifications of only one variable assignment) (=-=Minton et al. 1992-=-; Selman, Levesque, & Mitchell 1992; Ghedira 1993); constraint recording methods, which consist of recording any kind of constraint which can be deduced in the framework of a CSP and its justifica tio... |

359 | Dynamic backtracking
- Ginsberg
- 1993
(Show Context)
Citation Context ...) (no fixed variable). Comparisons and improvements The resulting algorithm is related to the backjumping (Dechter 1990; Prosser 1993), i&e&gent backtracking (Bruynooghe 1981), dy namic backtracking (=-=Ginsberg 1993-=-) and heuristic repair (Minton et al. 1992) algorithms, but is nevertheless different from each of them. Like the first one, it avoids useless backtracking on choices which are not involved in the cur... |

346 | Hybrid algorithms for the constraint satisfaction problem
- Prosser
- 1993
(Show Context)
Citation Context ...riables, the CSP can be solved using the procedure call Zc-variabZes( 0, Vz, V3) (no fixed variable). Comparisons and improvements The resulting algorithm is related to the backjumping (Dechter 1990; =-=Prosser 1993-=-), i&e&gent backtracking (Bruynooghe 1981), dy namic backtracking (Ginsberg 1993) and heuristic repair (Minton et al. 1992) algorithms, but is nevertheless different from each of them. Like the first ... |

271 |
Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition
- Dechter
- 1990
(Show Context)
Citation Context ...unassigned) variables, the CSP can be solved using the procedure call Zc-variabZes( 0, Vz, V3) (no fixed variable). Comparisons and improvements The resulting algorithm is related to the backjumping (=-=Dechter 1990-=-; Prosser 1993), i&e&gent backtracking (Bruynooghe 1981), dy namic backtracking (Ginsberg 1993) and heuristic repair (Minton et al. 1992) algorithms, but is nevertheless different from each of them. L... |

141 |
A.: Belief maintenance in dynamic constraint networks
- Dechter, Dechter
- 1988
(Show Context)
Citation Context ...ling applications; e the user: evolution of the user requirements in the framework of an interactive design; o other agents in the framework of a distributed tem. sysThe notion of dynamic CSP (DCSP) (=-=Dechter & Dechter 1988-=-) h as been introduced to represent such situations. A DCSP is a sequence of CSPs, where each one differs from the previous one by the addition or removal of some constraints. It is indeed easy to see... |

56 | A comparison of ATMS and CSP techniques - Kleer - 1989 |

33 | An efficient cross product representation of the constraint satisfaction problem search space - Hubbe, Freuder - 1989 |

32 | Solving combinatorial search problems by intelligent backtracking - Bruynooghe - 1981 |

13 |
Maintenance of solution in a dynamic constraint satisfaction problem
- Bellicha
- 1993
(Show Context)
Citation Context ...reas those of the last group only aim at improving efficiency. A little apart from the previous ones, a fourth group gathers methods which aim at minimizing the distance between successive solutions (=-=Bellicha 1993-=-). Key idea The proposed method originated in previous studies for the French Space Agency (CNES) (Badie & Verfaillie 1989) which aimed at designing a scheduling system for a remote sensing satellite ... |

12 |
Nogood Recording for Static and Dynamic CSP
- Schiex, Verfaillie
- 1993
(Show Context)
Citation Context ...ramework of a CSP and its justifica tion, in order to reuse it in the framework of any new Advances in Backtracking 397CSP which includes this justification(de Kleer 1989; Hentenryck & Provost 1991; =-=Schiex & Verfaillie 1993-=-). The methods of the first two groups aim at improving both efficiency and stability, whereas those of the last group only aim at improving efficiency. A little apart from the previous ones, a fourth... |

5 | MASC : une Approche Multi-Agent des Problemes de Satisfaction de Contraintes - Ghedira - 1993 |

2 |
OSCAR ou Comment Planifier Intelligemment des Missions Spatiales
- Badie, Verfaillie
- 1989
(Show Context)
Citation Context ...roup gathers methods which aim at minimizing the distance between successive solutions (Bellicha 1993). Key idea The proposed method originated in previous studies for the French Space Agency (CNES) (=-=Badie & Verfaillie 1989-=-) which aimed at designing a scheduling system for a remote sensing satellite (SPOT). In this problem, the set of tasks to be performed evolved each day because of the arrival of new tasks and the ach... |

1 |
MASC : une Approche Multi-Agent des Problimes de Satisfaction de Contraintes. These de doctorat
- Ghedira
- 1993
(Show Context)
Citation Context ...stent assignment (complete or not) and of repairing it, using a sequence of local modifications (modifications of only one variable assignment) (Minton et al. 1992; Selman, Levesque, & Mitchell 1992; =-=Ghedira 1993-=-); constraint recording methods, which consist of recording any kind of constraint which can be deduced in the framework of a CSP and its justifica tion, in order to reuse it in the framework of any n... |