Robustness in Dynamic Constraint Satisfaction Problems

[EN] Constraint programming is a successful technology for solving combinatorial problems modeled as constraint satisfaction problems (CSPs). Many real life problems are dynamic, which means that the initial description of the problem may change during its execution. These problems can be modeled as dynamic constraint satisfaction problems (DynCSPs), which are an important extension of the CSPs. In this paper, we focus our attention on the concept of robustness. Our aim is to find robust solutions which have a high probability of remaining valid faced with possible future changes in the constraints of the problem. We introduce the informed DynCSPs, proposing an approach to solve them by the weighted CSP (WCSP) modeling. Thus, the best solution for the modeled WCSP will be a robust solution for the original DynCSP. Furthermore, this technique has been evaluated in order to analyze the robustness of the solutions obtained.This work has been partially supported by the research projects TIN2010-20976-C02-01 (Min. de Ciencia e Innovación, Spain) and P19/08 (Min. de Fomento, Spain-FEDER), and the fellowship program FPU.Climent Aunés, LI.; Salido Gregorio, MA.; Barber Sanchís, F. (2012). Robustness in Dynamic Constraint Satisfaction Problems. International Journal of Innovative Computing Information and Control. 8(3):2513-2532. http://hdl.handle.net/10251/105809251325328