Interval probability propagation

AbstractBelief networks are tried as a method for propagation of singleton interval probabilities. A convex polytope representation of the interval probabilities is shown to make the problem intractable even for small parameters. A solution to this is to use the interval bounds directly in computations of the propagation algorithm. The algorithm presented leads to approximative results but has the advantage of being polynomial in time. It is shown that the method gives fairly good results