Boosting Probabilistic Choice Operators

Probabilistic Choice Operators (PCOs) are convenient tools to model uncertainty in CP. They are useful to implement randomized algorithms and stochastic processes in the concurrent constraint framework. Their implementation is based on the random selection of a value inside a finite domain according to a given probability distribution. Unfortunately, the probabilistic choice of a PCO is usually delayed until the probability distribution is completely known. This is inefficient and penalizes their broader adoption in real-world applications. In this paper, we associate to PCO a filtering algorithm that prunes the variation domain of its random variable during constraint propagation. Our algorithm runs in O(n) where n denotes the size of the domain of the probabilistic choice. Experimental results show the practical interest of this approach.

• Type: Conference
• Year: 2007
• Where: CP
• Authors: Matthieu Petit, Arnaud Gotlieb
• Keywords: CP 2007, Probabilistic Choice, Probabilistic Choice Operators, Probability Distribution, Programming Languages