Compiling Bayesian Networks with Local Structure
暂无分享,去创建一个
[1] DarwicheAdnan. A differential approach to inference in Bayesian networks , 2003 .
[2] Adnan Darwiche,et al. Decomposable negation normal form , 2001, JACM.
[3] Adnan Darwiche,et al. A differential semantics for jointree algorithms , 2002, Artif. Intell..
[4] Craig Boutilier,et al. Context-Specific Independence in Bayesian Networks , 1996, UAI.
[5] Prakash P. Shenoy,et al. Propagating Belief Functions with Local Computations , 1986, IEEE Expert.
[6] Nevin Lianwen Zhang,et al. Exploiting Contextual Independence In Probabilistic Inference , 2011, J. Artif. Intell. Res..
[7] Donald Loveland. A Machine Program for Theorem-Provingt , 2000 .
[8] Adnan Darwiche,et al. Recursive conditioning , 2001, Artif. Intell..
[9] Adnan Darwiche,et al. A differential approach to inference in Bayesian networks , 2000, JACM.
[10] Manfred Jaeger,et al. Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..
[11] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[12] Adnan Darwiche,et al. New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.
[13] Toniann Pitassi,et al. Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[14] Adnan Darwiche,et al. A Logical Approach to Factoring Belief Networks , 2002, KR.