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}
}
  • Jan Maluszy¿ski
  • Published 1997
  • Mathematics
  • 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
    Using intelligent backtracking to improve branch-and-bound methods: An application to Open-Shop problems
    • 61
    • PDF
    Dynamic Backtracking with Constraint
    Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming
    • 42
    • Highly Influenced
    • PDF
    Dynamic Domain Splitting for Numeric CSPs
    • 39
    • PDF
    Explanations and Proof Trees
    • 7
    • PDF
    Non-intrusive constraint solver enhancements
    • 9
    • PDF
    The versatility of using explanations within constraint programming
    • 56
    • Highly Influenced
    • PDF
    Correctness of Constraint Retraction Algorithms
    • 39
    • PDF