Constraint-Based Reasoning on Probabilistic Choice Operators - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Constraint-Based Reasoning on Probabilistic Choice Operators

Matthieu Petit
  • Function : Author
  • PersonId : 945280
Arnaud Gotlieb
  • Function : Author
  • PersonId : 830099


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.
Fichier principal
Vignette du fichier
RR-6165.pdf (220.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00140886 , version 1 (10-04-2007)
inria-00140886 , version 2 (24-04-2007)


  • 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⟩
63 View
37 Download


Gmail Facebook X LinkedIn More