Towards Precision of Probabilistic Bounds Propagation

03/13/2013
by   Helmut Thone, et al.
0

The DUCK-calculus presented here is a recent approach to cope with probabilistic uncertainty in a sound and efficient way. Uncertain rules with bounds for probabilities and explicit conditional independences can be maintained incrementally. The basic inference mechanism relies on local bounds propagation, implementable by deductive databases with a bottom-up fixpoint evaluation. In situations, where no precise bounds are deducible, it can be combined with simple operations research techniques on a local scope. In particular, we provide new precise analytical bounds for probabilistic entailment.

READ FULL TEXT

page 1

page 8

research
03/20/2013

Constraint Propagation with Imprecise Conditional Probabilities

An approach to reasoning with default rules where the proportion of exce...
research
03/27/2013

Incidence Calculus: A Mechanism for Probabilistic Reasoning

Mechanisms for the automation of uncertainty are required for expert sys...
research
02/27/2013

On Axiomatization of Probabilistic Conditional Independencies

This paper studies the connection between probabilistic conditional inde...
research
01/30/2013

Large Deviation Methods for Approximate Probabilistic Inference

We study two-layer belief networks of binary random variables in which t...
research
01/30/2013

Magic Inference Rules for Probabilistic Deduction under Taxonomic Knowledge

We present locally complete inference rules for probabilistic deduction ...
research
04/27/2018

Generalized Logical Operations among Conditional Events

We generalize, by a progressive procedure, the notions of conjunction an...

Please sign up or login with your details

Forgot password? Click here to reset