An axiomatic framework for influence diagram computation with partially ordered preferences
From MaRDI portal
Publication:2206449
DOI10.1016/j.ijar.2020.06.011zbMath1490.68236OpenAlexW3041053855MaRDI QIDQ2206449
Publication date: 22 October 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2020.06.011
Decision theory (91B06) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Enabling local computation for partially ordered preferences
- Sequential decision making with partially ordered preferences
- Influence diagrams with super value nodes involving imprecise information
- AND/OR branch-and-bound search for combinatorial optimization in graphical models
- Memory intensive AND/OR search for combinatorial optimization in graphical models
- Fusion and propagation with multiple observations in belief networks
- Probability propagation
- Credal networks
- Ordered valuation algebras: A generic framework for approximating inference
- A note about redundancy in influence diagrams
- Valuation network representation and solution of asymmetric decision problems
- Qualitative probabilities for default reasoning, belief revision, and causal modeling
- Evaluating interval-valued influence diagrams
- Updating credal networks is approximable in polynomial time
- Complexity results and algorithms for possibilistic influence diagrams
- Solving Limited Memory Influence Diagrams
- Representing and Solving Decision Problems with Limited Information
- Bayesian Networks and Decision Graphs
- Valuation-Based Systems for Bayesian Decision Analysis
