Synthesizing Filtering Algorithms for Global Chance-Constraints

@inproceedings{Hnich2009SynthesizingFA,
  title={Synthesizing Filtering Algorithms for Global Chance-Constraints},
  author={Brahim Hnich and Roberto Rossi and Armagan Tarim and Steven David Prestwich},
  booktitle={CP},
  year={2009}
}
Stochastic Constraint Satisfaction Problems (SCSPs) are a powerful modeling framework for problems under uncertainty. To solve them is a P-Space task. The only solution approach to date compiles down SCSPs 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 some of these drawbacks by automatically synthesizing filtering algorithms for global chance… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Algorithms for Stochastic CSPs

View 9 Excerpts
Highly Influenced

Stochastic Constraint Programming

ECAI • 2002
View 4 Excerpts
Highly Influenced

Introduction to Stochastic Programming

J. R. Birge, F. Louveaux
Springer Verlag, New York, • 1997
View 1 Excerpt

and the OCRE project team

F. Laburth
Choco: Implementing a cp kernel. Technical report, Bouygues e-Lab, France, • 1994
View 2 Excerpts

Deterministic equivalents for optimizing and satisficing under chance constraints

A. Charnes, W. W. Cooper
Operations Research, 11(1):18–39, • 1963
View 1 Excerpt

Theory of Probability

H. Jeffreys
Clarendon Press, Oxford, UK, • 1961
View 1 Excerpt

Similar Papers

Loading similar papers…