Complexity results and algorithms for possibilistic influence diagrams

DOI10.1016/j.artint.2007.11.008zbMath1183.62133OpenAlexW2077618895WikidataQ60558413 ScholiaQ60558413MaRDI QIDQ2389644

Régis Sabbadin, Laurent Garcia

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2007.11.008

zbMATH Keywords

decision theorypossibility theoryinfluence diagramscausal networks

Mathematics Subject Classification ID

Decision theory (91B06) Statistical decision theory (62C99) Sequential statistical analysis (62L10) Graphical methods in statistics (62A09)

Related Items

Evaluating interval-valued influence diagrams, Qualitative possibilistic influence diagrams based on qualitative possibilistic utilities, An axiomatic framework for influence diagram computation with partially ordered preferences

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Qualitative decision theory with preference relations and comparative uncertainty: an axiomatic approach
• Optimal control of diffusion processes with reflection
• Consistency in networks of relations
• On the transformation between possibilistic logic bases and possibilistic causal networks
• Stochastic dynamic programming with factored representations
• Towards qualitative approaches to multi-stage decision making
• Decomposition of Multi-operator Queries on Semiring-Based Graphical Models
• Decision-theoretic foundations of qualitative possibility theory