Computing probability intervals with simulated annealing and probability trees

DOI10.3166/jancl.12.151-171zbMath1060.68117OpenAlexW2071849264MaRDI QIDQ4453899

Serafín Moral, Andrés Cano, Juan M. Fernández-Luna

Publication date: 7 March 2004

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3166/jancl.12.151-171

zbMATH Keywords

Bayesian networksconvex set of probabilities

Mathematics Subject Classification ID

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

Related Items (1)

Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

Cites Work

• Optimization by Simulated Annealing
• Exploiting case-based independence for approximating marginal probabilities
• Interval probability propagation
• Using probability trees to compute marginals with imprecise probabilities
• Importance sampling in Bayesian networks using probability trees.
• Strong conditional independence for credal sets
• PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
• Representing and Solving Decision Problems with Limited Information
• Removing partial inconsistency in valuation-based systems
• Unnamed Item

This page was built for publication: Computing probability intervals with simulated annealing and probability trees