TY - JOUR
T1 - Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
AU - Shimony, Solomon E.
AU - Domshlak, Carmel
N1 - Funding Information:
We would like to thank Amos Beimel for useful suggestions and pointers to some of the NP-hard problem variants used in the reductions. Research partially supported by an infrastructure grant from the Israeli Ministry of Science, and by the Paul Ivanier Center for Robotics and Production Management at Ben-Gurion University.
PY - 2003/12/1
Y1 - 2003/12/1
N2 - 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.
AB - 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.
KW - Bayes networks
KW - Complexity
KW - Probabilistic reasoning
KW - Singly-connected DAGs
UR - http://www.scopus.com/inward/record.url?scp=0242365710&partnerID=8YFLogxK
U2 - 10.1016/S0004-3702(03)00110-3
DO - 10.1016/S0004-3702(03)00110-3
M3 - Article
AN - SCOPUS:0242365710
SN - 0004-3702
VL - 151
SP - 213
EP - 225
JO - Artificial Intelligence
JF - Artificial Intelligence
IS - 1-2
ER -