Robustness and stability in dynamic constraint satisfaction problems

Uncertainty in dynamic constraint satisfaction problems

“…Many approaches from the literature [2] are useless in such problematic situations. The main motivation of this PhD dissertation [1] is to develop approaches that can provide solutions with a certain level of robustness for problems where the only data available is the one required for modeling the CSP. Robust solutions have a high likelihood of remaining valid after further possible changes in the original problem.…”

Robustness and stability in dynamic constraint satisfaction problems

“…• Chapter 4, Probabilistic Enumeration-based Technique: We propose a new probabilistic approach (Climent et al, 2012a). This enumeration-based technique models CSPs with extra information about the dynamism of their bounds as WCSPs, with the objective of finding robust solutions according to this dynamism knowledge.…”

“…In this thesis we present three enumeration-based techniques for finding robust solutions (Climent et al, 2012a(Climent et al, , 2013b. Due to the enumeration characteristic of them, they only can be applied to discrete domains.…”

“…This chapter introduces a new probabilistic enumeration-based technique that models CSPs as WCSPs (Climent et al, 2012a). Its main objective is to find robust solutions according to extra information about the future changes over the bounds of the CSPs.…”

“…In there are examples of the simulation of restrictive modifications of informed constraints. Moreover, the evaluation of the probabilistic enumeration-based approach can be found in (Climent et al, 2012a).…”