1. C.P. de Campos, F.G. Cozman, The inferential complexity of Bayesian and credal networks, in: Proceedings of the International Joint Conference on Artificial Intelligence, Edinburgh, 2005, pp. 1313–1318.
2. 2U: an exact interval propagation algorithm for polytrees with binary variables;Fagiuoli;Artificial Intelligence,1998
3. J.S. Ide, F.G. Cozman, IPE and L2U: approximate algorithms for credal networks, in: Proceedings of the Second Starting AI Researcher Symposium, IOS Press, Amsterdam, 2004, pp. 118–127.
4. Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks;Antonucci;International Journal of Approximate Reasoning,2008
5. A. Antonucci, M. Zaffalon, J.S. Ide, F.G. Cozman, Binarization algorithms for approximate updating in credal nets, in: L. Penserini, P. Peppas, A. Perini (Eds.), Proceedings of the third European Starting AI Researcher Symposium, IOS Press, Amsterdam, 2006, pp. 120–131.