T. Balafoutis and K. Stergiou, Algorithms for Stochastic CSPs, Proc. of Int. Conf. on Principles and Practice of Constraint Programming (CP), pp.44-58, 2006.
DOI : 10.1007/11889205_6
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.97.4598

M. Benedetti, A. Lallouet, and J. Vautard, QCSP made practical by virtue of restricted quantification, Proc. of Int. Joint. Conf. on Artificial Intelligence (IJCAI), pp.38-43, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00144921

F. Benhamou, D. A. Mcallester, and P. Van-hentenryck, CLP(Intervals) revisited, Proc. of Int. Logic Programming Symposium, pp.124-138, 1984.

L. Bordeaux and H. Samulowitz, On the stochastic constraint satisfaction framework, Proceedings of the 2007 ACM symposium on Applied computing , SAC '07, pp.316-320, 2007.
DOI : 10.1145/1244002.1244077

K. N. Brown, J. Little, and E. C. Freuder, Adversarial constraint satisfaction by game-tree search

G. Pesant, Counting solutions of CSPs : A structural approach, Proc. of Int. Joint. Conf. on Artificial Intelligence (IJCAI), pp.260-265, 2005.

C. Pralet, T. Schiex, and G. Verfaillie, Decomposition of Multi-operator Queries on Semiring-Based Graphical Models, Proc. of Int. Conf. on Principles and Practice of Constraint Programming (CP), pp.437-452, 2006.
DOI : 10.1007/11889205_32

A. Tarim, S. Manandhar, and T. Walsh, Stochastic Constraint Programming: A Scenario-Based Approach, Constraints, vol.88, issue.2, pp.53-80, 2006.
DOI : 10.1007/s10601-006-6849-7

T. Walsh, Stochastic constraint programming, Proc. of Euro. Conf. on Artificial Intelligence (ECAI), pp.111-115, 2002.