"probabilistic graphical models"

Thirty years of credal networks: Specification, algorithms and complexity
We review 30 years of research in Bayesian networks with set-valued parameters.
On the Complexity of Strong and Epistemic Credal Networks
A Fully Polynomial Time Approximation Scheme for Updating Credal Networks of Bounded Treewidth and Number of Variable States