A credal network associates a directed acyclic graph with a collection of sets of probability measures; it offers a compact representation for sets of multivariate distributions. In this paper we present a new algorithm for inference in credal networks based on an integer programming reformulation. We are concerned with computation of lower/upper probabilities for a variable in a given credal network. Experiments reported in this paper indicate that this new algorithm has better performance than existing ones for some important classes of networks.
Keywords. Credal networks, Integer Programming
The paper is availabe in the following formats:
University of Sao Paulo
Sao Paulo, SP, Brazil
Av. Prof. Mello Moraes, 2231
Cidade Univesitaria, CEP 05508-900
Sao Paulo, SP - BRAZIL