Uncertainty in dynamic constraint satisfaction problems

Abstract

Many real life problems that can be modeled as Constraint Satisfaction Problems (CSPs) come from uncertain and \ndynamic environments, so the original solution found might become invalid after changes. Here, we study the problem of finding \nrobust solutions for CSPs under the assumptions that domains are significantly ordered and that changes take the form of \nrestrictions or relaxations at the borders of the solution space of the CSPs.