Uncertainty in Dynamic Constraint Satisfaction Problems

Many real life problems that can be modeled as Constraint Satisfaction Problems (CSPs) come from uncertain and dynamic environments, so the original solution found might become invalid after changes. Here, we study the problem of finding robust solutions for CSPs under the assumptions that domains are significantly ordered and that changes take the form of restrictions or relaxations at the borders of the solution space of the CSPs.This work was supported by the FPU and the project TIN2013-46511-C2-1-P (MINECO, Spain).Climent, L.; Salido Gregorio, MA.; Wallace, RJ.; Barber Sanchís, F. (2016). Uncertainty in Dynamic Constraint Satisfaction Problems. AI Communications. 29(1):239-241. https://doi.org/10.3233/AIC-150657239241291Verfaillie, G., & Jussien, N. (2005). Constraint Solving in Uncertain and Dynamic Environments: A Survey. Constraints, 10(3), 253-281. doi:10.1007/s10601-005-2239-