HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Constraint-Based Reasoning on Probabilistic Choice Operators

Matthieu Petit 1 Arnaud Gotlieb 1
1 Lande - Logiciel : ANalyse et DEveloppement
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
Abstract : Probabilistic Concurrent Constraint Programming (PCCP) extends concurrent constraint languages with a probabilistic choice operator. This operator has proved to be useful in implementing randomized algorithms as well as stochastic processes. In this report, we present a filtering algorithm dedicated to the probabilistic choice operator which permits to address new kind of applications where probabilistic choices are partially known. This filtering algorithm helps to deduce information on the possible values of the probabilistic choice without requiring its full valuation. An implementation under the form of a library of SICStus Prolog is presented.
Complete list of metadata

Cited literature [18 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, April 24, 2007 - 12:09:29 PM
Last modification on : Friday, February 4, 2022 - 3:18:28 AM
Long-term archiving on: : Monday, June 27, 2011 - 3:45:40 PM


Files produced by the author(s)


  • HAL Id : inria-00140886, version 2


Matthieu Petit, Arnaud Gotlieb. Constraint-Based Reasoning on Probabilistic Choice Operators. [Research Report] RR-6165, INRIA. 2007, pp.21. ⟨inria-00140886v2⟩



Record views


Files downloads