Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm

DOI10.1016/j.ijar.2004.10.009zbMath1099.68112OpenAlexW2032300430MaRDI QIDQ2386120

José Carlos Ferreira Da Rocha, Fabio Gagliardi Cozman

Publication date: 22 August 2005

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2004.10.009

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (3)

Updating credal networks is approximable in polynomial time ⋮ Approximate algorithms for credal networks with binary variables ⋮ Thirty years of credal networks: specification, algorithms and complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Advances in geometric programming
• Interval probability propagation
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Geometric foundations for interval-based probabilities
• Using probability trees to compute marginals with imprecise probabilities
• Credal networks
• Increased robustness of Bayesian networks through probability intervals
• An axiomatic framework for propagating uncertainty in directed acyclic networks
• Geometric programming with signomials
• Sensitivity in Bayesian Statistics: The Prior and the Likelihood

This page was built for publication: Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm