scientific article

zbMath0742.68076arXiv1304.1093MaRDI QIDQ3979383

Solomon Eyal Shimony, Eugene Charniak

Publication date: 26 June 1992

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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)

Related Items

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, Multi-dimensional classification with Bayesian networks, A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem, A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks, 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, Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty, The role of relevance in explanation. II: Disjunctive assignments and approximate independence, AND/OR branch-and-bound search for combinatorial optimization in graphical models, Probabilistic Horn abduction and Bayesian networks, A linear constraint satisfaction approach to cost-based abduction, Approximating cost-based abduction is NP-hard