Using probability trees to compute marginals with imprecise probabilities Cano Utrera, Andrés Moral Callejón, Serafín Dependence graphs Interval probabilities Propagation algorithms Probability trees Inteligencia artificial Artificial intelligence 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. 2022-11-10T09:27:21Z 2022-11-10T09:27:21Z 2001-11-12 journal article Andrés Cano, Serafín Moral, Using probability trees to compute marginals with imprecise probabilities, International Journal of Approximate Reasoning, Volume 29, Issue 1, 2002, Pages 1-46, ISSN 0888-613X, [https://doi.org/10.1016/S0888-613X(01)00046-9] https://hdl.handle.net/10481/77876 10.1016/S0888-613X(01)00046-9 eng http://creativecommons.org/licenses/by-nc-nd/4.0/ open access Attribution-NonCommercial-NoDerivatives 4.0 Internacional Elsevier