TY  - GEN 
AU  - Cano Utrera, Andrés
AU  - Gómez Olmedo, Manuel
AU  - Moral Callejón, Serafín
AU  - Abellán Mulero, Joaquín
PY  - 2006
UR  - https://hdl.handle.net/10481/77902
AB  - 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...
LA  - eng
PB  - Elsevier
KW  - Credal network
KW  - Probability intervals
KW  - Bayesian networks
KW  - Strong independence
KW  - Hill-climbing
KW  - Branch-and-bound algorithms
KW  - Inteligencia artificial
KW  - Artificial intelligence
TI  - Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
DO  - 10.1016/j.ijar.2006.07.020
ER  -