| Global optimization of probabilistically constrained linear programs | p. 1 |
| Algorithms and constraint programming | p. 2 |
| Interval analysis and robotics | p. 15 |
| Constraint based resilience analysis | p. 16 |
| Infinite qualitative simulations by means of constraint programming | p. 29 |
| Algorithms for stochastic CSPs | p. 44 |
| Graph properties based filtering | p. 59 |
| The ROOTS constraint | p. 75 |
| CoJava : optimization modeling by nondeterministic simulation | p. 91 |
| An algebraic characterisation of complexity for valued constraints | p. 107 |
| Typed guarded decompositions for constraint satisfaction | p. 122 |
| Propagation in CSP and SAT | p. 137 |
| The minimum spanning tree constraint | p. 152 |
| Impact of censored sampling on the performance of restart strategies | p. 167 |
| Watched literals for constraint propagation in minion | p. 182 |
| Inner and outer approximations of existentially quantified equality constraints | p. 198 |
| Performance prediction and automated tuning of randomized and parametric algorithms | p. 213 |
| Adaptive clause weight redistribution | p. 229 |
| Localization of an underwater robot using interval constraint propagation | p. 244 |
| Approximability of integer programming with generalised constraints | p. 256 |
| When constraint programming and local search solve the scheduling problem of Electricite de France nuclear power plant outages | p. 271 |
| Generalized arc consistency for positive table constraints | p. 284 |
| Stochastic allocation and scheduling for conditional task graphs in MPSoCs | p. 299 |
| Boosting open CSPs | p. 314 |
| Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs) | p. 329 |
| Distributed constraint-based local search | p. 344 |
| High-level nondeterministic abstractions in C++ | p. 359 |
| A structural characterization of temporal dynamic controllability | p. 375 |
| When interval analysis helps inter-block backtracking | p. 390 |
| Randomization in constraint programming for airline planning | p. 406 |
| Towards an efficient SAT encoding for temporal reasoning | p. 421 |
| Decomposition of multi-operator queries on semiring-based graphical models | p. 437 |
| Dynamic lex constraints | p. 453 |
| Generalizing AllDifferent : the SomeDifferent constraint | p. 468 |
| Mini-bucket elimination with bucket propagation | p. 484 |
| Constraint satisfaction with bounded treewidth revisited | p. 499 |
| Preprocessing QBF | p. 514 |
| The theory of grammar constraints | p. 530 |
| Constraint programming models for graceful graphs | p. 545 |
| A simple distribution-free approach to the Max k-Armed bandit problem | p. 560 |
| Generating propagators for finite set constraints | p. 575 |
| Compiling finite linear CSP into SAT | p. 590 |
| Differentiable invariants | p. 604 |
| Revisiting the sequence constraint | p. 620 |
| BlockSolve : a bottom-up approach for solving quantified CSPs | p. 635 |
| General symmetry breaking constraints | p. 650 |
| Inferring variable conflicts for local search | p. 665 |
| Reasoning by dominance in not-equals binary constraint networks | p. 670 |
| Distributed stable matching problems with ties and incomplete lists | p. 675 |
| Soft arc consistency applied to optimal planning | p. 680 |
| A note on low autocorrelation binary sequences | p. 685 |
| Relaxations and explanations for quantified constraint satisfaction problems | p. 690 |
| Static and dynamic structural symmetry breaking | p. 695 |
| The modelling language zinc | p. 700 |
| A filter for the circuit constraint | p. 706 |
| A new algorithm for sampling CSP solutions uniformly at random | p. 711 |
| Sports league scheduling : enumerative search for Prob026 from CSPLib | p. 716 |
| Dynamic symmetry breaking restarted | p. 721 |
| The effect of constraint representation on structural tractability | p. 726 |
| Failure analysis in backtrack search for constraint satisfaction | p. 731 |
| Heavy-tailed runtime distributions : heuristics, models and optimal refutations | p. 736 |
| An extension of complexity bounds and dynamic heuristics for tree-decompositions of CSP | p. 741 |
| Clique inference process for solving Max-CSP | p. 746 |
| Global grammar constraints | p. 751 |
| Constraint propagation for domain bounding in distributed task scheduling | p. 756 |
| Interactive distributed configuration | p. 761 |
| Retroactive ordering for dynamic backtracking | p. 766 |
| Table of Contents provided by Blackwell. All Rights Reserved. |