Robustness and Stability in Constraint Programming under Dynamism and Uncertainty

摘要

In this paper we extend the concept of robustness and stability to deal with CSPs with discrete and ordered domains where only limited assumptions can be made about changes in these problems due to a lack of detailed dynamism information. Furthermore, we present a new search algorithm that combines criteria for both robustness and stability in this framework by searching for a solution that maximizes the sum of contiguous feasible surrounding neighbours at distances of k or less from the values of the solution.