scientific article; zbMATH DE number 4189219

MaRDI QIDQ5753553zbMATH OpenFDO

Authors Kenneth W. Fertig, John S. Breese

Publication date 1990

Full work available at URL https://arxiv.org/abs/1304.1503

zbMATH Keywords

influence diagrams

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Logic in artificial intelligence (68T27)

Recommendations

• Evaluating interval-valued influence diagrams
• Variable elimination for interval-valued influence diagrams
• Probabilistic Inference and Influence Diagrams
• scientific article; zbMATH DE number 865677
• scientific article; zbMATH DE number 3978443

Cited in

(22)

• Partially observable Markov decision processes with imprecise parameters
• Interval probability propagation
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Geometric foundations for interval-based probabilities
• Potential influence diagrams
• Using probability trees to compute marginals with imprecise probabilities
• Propagating imprecise probabilities in Bayesian networks
• Bayesian network implementation of Levi's epistemic utility decision theory
• Increased robustness of Bayesian networks through probability intervals
• Uncertain inference using interval probability theory
• Measures of uncertainty in expert systems
• Thirty years of credal networks: specification, algorithms and complexity
• Evaluating interval-valued influence diagrams
• Graphical models for imprecise probabilities
• The principle of interval constraints: A generalization of the symmetric Dirichlet distribution
• Probabilistic logic revisited
• Variable elimination for interval-valued influence diagrams
• scientific article; zbMATH DE number 5183801 (Why is no real title available?)
• scientific article; zbMATH DE number 845703 (Why is no real title available?)
• scientific article; zbMATH DE number 865677 (Why is no real title available?)
• Strategy Graphs for Influence Diagrams
• Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5753553)