6533b836fe1ef96bd12a1174
RESEARCH PRODUCT
Algorithms for coherence checking and propagation of conditional probability bounds
A GilioV BiazzoGiuseppe Sanfilipposubject
reduced sets of variables and constraintsSettore MAT/06 - Probabilita' E Statistica MatematicaUncertain knowledgeUncertain knowledge probabilistic reasoning under coherence imprecise conditional probability assessments g-coherence checking g-coherent extension algorithms computational aspects reduced sets of variables reduced sets of linear constraints.g-coherent extensionimprecise conditional probability assessmentsg-coherence checkingUncertain knowledge; probabilistic reasoning under coherence; imprecise conditional probability assessments; g-coherence checking; g-coherent extension; algorithms.; computational aspects; reduced sets of variables and constraints.algorithmsprobabilistic reasoning under coherencecomputational aspectsdescription
In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of variables and a reduced set of linear constraints. We also show how to compute such reduced sets. Finally, we illustrate our methods by an example related to probabilistic default reasoning.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2001-01-01 |