Inference in Polytrees with Sets of Probabilities

@article{Rocha2008InferenceIP,
  title={Inference in Polytrees with Sets of Probabilities},
  author={Jos{\'e} Carlos Ferreira da Rocha and F{\'a}bio Gagliardi Cozman and Cassio Polpo de Campos},
  journal={CoRR},
  year={2008},
  volume={abs/1212.2458}
}
Inferences in directed acyclic graphs associated with probability intervals and sets of probabilities are NP-hard, evenfor polytrees. We propose: 1) an improvement on Tessem’s A/R algorithm for inferences on polytrees associated with probability intervals; 2) a new algorithm for approximate inferences based on local search; 3) branch-and-bound algorithms that combine the previous techniques. The first two algorithms produce complementary approximate solutions, while branch-and-bound procedures… CONTINUE READING