Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. The only complete solution approach to date — scenario-based stochastic constraint programming — compiles SCSPs down into classical CSPs. This allows the reuse of classical constraint solvers to solve SCSPs, but at the cost of increased space req...

We address the inclusion of stochastic information into an explicitly timed concurrent constraint process language. An operational semantics is proposed as a preliminary result. Our approach finds applications in biology, among

We study stochastic variants of flow-based global constraints as combinatorial chance constraints. As a specific case study, we focus on the stochastic weighted alldifferent constraint. We first show that determining the consistency of this constraint is NP-hard. We then show how the combinatorial structure of the alldifferent constraint can be used to define chance-based filtering, and to comp...

To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number of important dimensions (e.g. to multiple chance constraints and to a range of new objectives). We also provide a new (but equivalent) semantics based on scenarios. Using this semantics, we can compile stochastic const...

We introduce a stochastic dynamic optimization problem, where risk aversion is expressed by a stochastic ordering constraint. The constraint requires that a random reward sequence depending on our decisions dominates a given benchmark random sequence. The dominance is defined by discounting both processes with a family of discount sequences, and by applying a univariate order. We describe the g...

An indefinite stochastic Riccati Equation is a matrix-valued, highly nonlinear backward stochastic differential equation together with an algebraic, matrix positive definiteness constraint. We introduce a new approach to solve a class of such equations (including the existence of solutions) driven by one-dimensional Brownian motion. The idea is to replace the original equation by a system of BS...

Considering first-order stochastic dominance constraints for random variables arising as optimal values of stochastic programs with linear recourse, verifiable sufficient conditions for metric regularity are presented. A growth condition developed in [22] has a crucial role in the analysis of the present paper. Implications regarding stability and sensitivity of optimal values and optimal solut...