@misc{10481/77876,
year = {2001},
month = {11},
url = {https://hdl.handle.net/10481/77876},
abstract = {This paper presents an approximate algorithm to obtain a posteriori intervals of probability, when available information is also given with intervals. The algorithm uses probability trees as a means of representing and computing with the convex sets of probabilities associated to the intervals.},
publisher = {Elsevier},
keywords = {Dependence graphs},
keywords = {Interval probabilities},
keywords = {Propagation algorithms},
keywords = {Probability trees},
keywords = {Inteligencia artificial},
keywords = {Artificial intelligence},
title = {Using probability trees to compute marginals with imprecise probabilities},
doi = {10.1016/S0888-613X(01)00046-9},
author = {Cano Utrera, Andrés and Moral Callejón, Serafín},
}