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 metadatas

Cited literature [18 references]  Display  Hide  Download

https://hal.inria.fr/inria-00140886
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, April 24, 2007 - 12:09:29 PM
Last modification on : Friday, November 16, 2018 - 1:25:10 AM
Long-term archiving on : Monday, June 27, 2011 - 3:45:40 PM

Files

RR-6165.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00140886, version 2

Citation

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

Share

Metrics

Record views

136

Files downloads

62