Troubleshooting using probabilistic networks and value of information

DOI10.1016/S0888-613X(01)00057-3zbMATH Open1015.68180OpenAlexW2078117166MaRDI QIDQ1347871FDOQ1347871

Authors: Korhan Gökçay, Taner Bilgiç 

Publication date: 15 May 2002

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

Full work available at URL: https://doi.org/10.1016/s0888-613x(01)00057-3

Recommendations

• Complexity of decision-theoretic troubleshooting
• Troubleshooting: NP-hardness and solution methods
• Decision-theoretic troubleshooting: hardness of approximation
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Scheduling results applicable to decision-theoretic troubleshooting

zbMATH Keywords

influence diagramsprobabilistic networkstroubleshooting

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Approximating probabilistic inference in Bayesian belief networks is NP- hard
• The computational complexity of probabilistic inference using Bayesian belief networks
• Title not available (Why is that?)
• The SACSO methodology for troubleshooting complex systems

Cited In (7)

• Decision-theoretic troubleshooting: hardness of approximation
• Title not available (Why is that?)
• The SACSO methodology for troubleshooting complex systems
• Complexity of decision-theoretic troubleshooting
• Scheduling results applicable to decision-theoretic troubleshooting
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Troubleshooting: NP-hardness and solution methods

Uses Software

• HUGIN

This page was built for publication: Troubleshooting using probabilistic networks and value of information

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