Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
On the stochastic constraint satisfaction framework
Proceedings of the 2007 ACM symposium on Applied computing
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Cost-Based Domain Filtering for Stochastic Constraint Programming
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
MINION: A Fast, Scalable, Constraint Solver
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Synthesizing filtering algorithms for global chance-constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Evolving parameterised policies for stochastic constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A constraint satisfaction framework for decision under uncertainty
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Algorithms for stochastic CSPs
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Stochastic constraint programming by neuroevolution with filtering
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Constraint satisfaction problems: convexity makes all different constraints tractable
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Finding (α, ϑ)-solutions via sampled SCSPs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a PSPACE 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 requirements and weak constraint propagation. This paper tries to overcome these drawbacks by automatically synthesizing filtering algorithms for global chance constraints. These filtering algorithms are parameterized by propagators for the deterministic version of the chance constraints. This approach allows the reuse of existing propagators in current constraint solvers and it has the potential to enhance constraint propagation. Our results show that, for the test bed considered in this work, our approach is superior to scenario-based stochastic constraint programming. For these instances, our approach is more scalable, it produces more compact formulations, it is more efficient in terms of run time and more effective in terms of pruning for both stochastic constraint satisfaction and optimization problems.