scientific article; zbMATH DE number 19872

MaRDI QIDQ3979383zbMATH OpenFDO

Authors Solomon E. Shimony, Eugene Charniak

Publication date 26 June 1992

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

zbMATH Keywords

belief networksMAP assignments

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Approximating MAPs for belief networks is NP-hard and other theorems
• An algorithm for finding MAPs for belief networks through cost-based abduction
• An algorithm for finding MAPs for belief networks through cost-based abduction
• An algorithm for finding MAPs for belief networks through cost-based abduction
• Finding MAPs for belief networks is NP-hard

Cited in

(22)

• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks
• Approximating MAPs for belief networks is NP-hard and other theorems
• Probabilistic Horn abduction and Bayesian networks
• A linear constraint satisfaction approach to cost-based abduction
• Cost-based abduction and MAP explanation
• Finding MAPs for belief networks is NP-hard
• Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks
• An optimal approximation algorithm for Bayesian inference
• Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty
• The role of relevance in explanation. II: Disjunctive assignments and approximate independence
• A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem
• Node assignment problem in Bayesian networks
• scientific article; zbMATH DE number 1045396 (Why is no real title available?)
• scientific article; zbMATH DE number 1834036 (Why is no real title available?)
• An algorithm for finding MAPs for belief networks through cost-based abduction
• A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• An algorithm for finding MAPs for belief networks through cost-based abduction
• An algorithm for finding MAPs for belief networks through cost-based abduction
• Multi-dimensional classification with Bayesian networks
• Approximating cost-based abduction is NP-hard

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 Q3979383)