A Logical Approach to Factoring Belief Networks
暂无分享,去创建一个
[1] Adnan Darwiche,et al. Inference in belief networks: A procedural guide , 1996, Int. J. Approx. Reason..
[2] Adnan Darwiche,et al. A differential approach to inference in Bayesian networks , 2000, JACM.
[3] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[4] Enrico Macii,et al. Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[5] Prakash P. Shenoy,et al. Propagating Belief Functions with Local Computations , 1986, IEEE Expert.
[6] Adnan Darwiche,et al. Decomposable negation normal form , 2001, JACM.
[7] Nevin Lianwen Zhang,et al. Exploiting Causal Independence in Bayesian Network Inference , 1996, J. Artif. Intell. Res..
[8] Adnan Darwiche,et al. Testing Equivalence Probabilistically , 2002 .
[9] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[10] Zhaoyu Li,et al. Efficient inference in Bayes networks as a combinatorial optimization problem , 1994, Int. J. Approx. Reason..
[11] Adnan Darwiche,et al. A differential semantics for jointree algorithms , 2002, Artif. Intell..
[12] Jesse Hoey,et al. SPUDD: Stochastic Planning using Decision Diagrams , 1999, UAI.
[13] David Poole,et al. Context-specific approximation in probabilistic inference , 1998, UAI.
[14] Mark Hopkins,et al. Using Recursive Decomposition to Construct Elimination Orders, Jointrees, and Dtrees , 2001, ECSQARU.
[15] Thomas D. Nielsen,et al. Using ROBDDs for Inference in Bayesian Networks with Troubleshooting as an Example , 2000, UAI.
[16] G. Unter Rote. Path Problems in Graphs , 1989 .
[17] Uue Kjjrull. Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .
[18] Craig Boutilier,et al. Context-Specific Independence in Bayesian Networks , 1996, UAI.
[19] Kristian G. Olesen,et al. HUGIN - a Shell for Building Belief Universes for Expert Systems , 1989, IJCAI 1989.
[20] Kathryn B. Laskey,et al. Representing and Combining Partially Specified CPTs , 1999, UAI.
[21] Nir Friedman,et al. Learning Bayesian Networks with Local Structure , 1996, UAI.
[22] Volker Strassen,et al. Algebraic Complexity Theory , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[23] Pierre Marquis,et al. A Perspective on Knowledge Compilation , 2001, IJCAI.
[24] Kristian G. Olesen,et al. HUGIN - A Shell for Building Bayesian Belief Universes for Expert Systems , 1989, IJCAI.
[25] Rina Dechter,et al. An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits , 1996, UAI.
[26] Frank Jensen,et al. Approximations in Bayesian Belief Universe for Knowledge Based Systems , 2013, UAI 1990.
[27] Bruce D'Ambrosio,et al. Local expression languages for probabilistic dependence , 1995, Int. J. Approx. Reason..
[28] Adnan Darwiche,et al. A compiler for deterministic, decomposable negation normal form , 2002, AAAI/IAAI.