Best-first search for property maintenance in reactive constraints systems
@inproceedings{Maluszyski1997BestfirstSF, title={Best-first search for property maintenance in reactive constraints systems}, author={Jan Maluszy¿ski}, year={1997} }
Real-life dynamic problems may lead to inconsistent constraints systems for which a solution must be found even if constraints have to be relaxed. In this paper, we propose a best-first search to handle such problems. Classical backtracking search algorithms are extended in two ways: identification of good backtrack points as in Intelligent Backtracking techniques and maximum use of independant work (that would have been discarded with a mere backtrack). We first describe an operational… CONTINUE READING
13 Citations
Dynamic Backtracking with Constraint Propagation Application to static and dynamic CSPs
- Computer Science
- 1997
- 11
Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
- Computer Science, Mathematics
- Eur. J. Oper. Res.
- 2000
- 61
- PDF
Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
- Computer Science
- PATAT
- 2004
- 42
- Highly Influenced
- PDF
The versatility of using explanations within constraint programming
- Computer Science
- 2003
- 56
- Highly Influenced
- PDF