Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks

Authors:
Solomon E. Shimony;Carmel Domshlak
Affiliations:
Department of Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel;Department of Computer Science, Cornell University, Ithaca, NY
Venue:
Artificial Intelligence
Year:
2003

Citing 24
Cited 3

NP is as easy as detecting unique solutions

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A probabilistic causal model for diagnostic problem solving, part one: integrating symbolic causal inference with numeric probabilistic inference

IEEE Transactions on Systems, Man and Cybernetics - Special issue on artificial intelligence
Evaluating influence diagrams

Operations Research
Probabilistic reasoning in expert systems: theory and algorithms

Probabilistic reasoning in expert systems: theory and algorithms
The computational complexity of probabilistic inference using Bayesian belief networks (research note)

Artificial Intelligence
Introduction to algorithms

Introduction to algorithms
Bayesian networks without tears: making Bayesian networks more accessible to the probabilistically unsophisticated

AI Magazine
Approximating probabilistic inference in Bayesian belief networks is NP-hard

Artificial Intelligence
Probabilistic Horn abduction and Bayesian networks

Artificial Intelligence
Finding MAPs for belief networks is NP-hard

Artificial Intelligence
On the hardness of approximate reasoning

Artificial Intelligence
Local conditioning in Bayesian networks

Artificial Intelligence
Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks

Artificial Intelligence
Approximating MAPs for belief networks is NP-hard and other theorems

Artificial Intelligence
Graph orientations with no sink and an approximation for a hard case of #SAT

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
An O(|V|2) algorithm for single connectedness

Information Processing Letters
Recursive conditioning

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Correctness of Local Probability Propagation in Graphical Models with Loops

Neural Computation
Learning polytrees

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
MAP complexity results and approximation methods

UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
A comparison of Lauritzen-Spiegelhalter, Hugin, and Shenoy-Shafer architectures for computing marginals of probability distributions

UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Conditioning algorithms for exact and approximate inference in causal networks

UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence

Approximate belief updating in max-2-connected Bayes networks is NP-hard

Artificial Intelligence
CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements

Journal of Artificial Intelligence Research
A learning-based algorithm selection meta-reasoner for the real-time MPE problem

AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Directed-path (DP) singly-connected Bayesian networks are an interesting special case that, in particular, includes both polytrees and two-level networks. We analyze the computational complexity of these networks. The prediction problem is shown to be easy, as standard message passing can perform correct updating. However, diagnostic reasoning is hard even for DP singly-connected networks. In addition, finding the most-probable explanation (MPE) is hard, even without evidence. Finally, complexity of nearly DP singly-connected networks is analyzed.