@misc{10481/77902,
year = {2006},
month = {9},
url = {https://hdl.handle.net/10481/77902},
abstract = {This paper proposes two new algorithms for inference in credal networks. These algorithms
enable probability intervals to be obtained for the states of a given query variable. The first
algorithm is approximate and uses the hill-climbing technique in the Shenoy–Shafer architecture
to propagate in join trees; the second is exact and is a modification of Rocha and Cozman’s
branch-and-bound algorithm, but applied to general directed acyclic graphs.},
organization = {TIN2004-06204-C03-02},
publisher = {Elsevier},
keywords = {Credal network},
keywords = {Probability intervals},
keywords = {Bayesian networks},
keywords = {Strong independence},
keywords = {Hill-climbing},
keywords = {Branch-and-bound algorithms},
keywords = {Inteligencia artificial},
keywords = {Artificial intelligence},
title = {Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks},
doi = {10.1016/j.ijar.2006.07.020},
author = {Cano Utrera, Andrés and Gómez Olmedo, Manuel and Moral Callejón, Serafín and Abellán Mulero, Joaquín},
}