Solving Bayesian Networks by Weighted Model Counting
暂无分享,去创建一个
[1] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[2] David J. Spiegelhalter,et al. Probabilistic Reasoning in Predictive Expert Systems , 1985, UAI.
[3] Judea Pearl,et al. Probabilistic reasoning in intelligent systems , 1988 .
[4] Rina Dechter,et al. Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition , 1990, Artif. Intell..
[5] D. Heckerman,et al. ,81. Introduction , 2022 .
[6] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[7] David G. Mitchell,et al. Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.
[8] Joao Marques-Silva,et al. GRASP-A new search algorithm for satisfiability , 1996, Proceedings of International Conference on Computer Aided Design.
[9] Roberto J. Bayardo,et al. Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.
[10] Michael L. Littman,et al. Using Caching to Solve Larger Probabilistic Planning Problems , 1998, AAAI/IAAI.
[11] Rina Dechter,et al. Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..
[12] Bart Selman,et al. Unifying SAT-based and Graph-based Planning , 1999, IJCAI.
[13] Michael L. Littman,et al. Initial Experiments in Stochastic Satisfiability , 1999, AAAI/IAAI.
[14] Sharad Malik,et al. Efficient conflict driven learning in a Boolean satisfiability solver , 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).
[15] Adnan Darwiche,et al. Recursive conditioning , 2001, Artif. Intell..
[16] Adnan Darwiche,et al. A Logical Approach to Factoring Belief Networks , 2002, KR.
[17] David Allen,et al. New Advances in Inference by Recursive Conditioning , 2002, UAI.
[18] Bart Selman,et al. Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search , 2003, CP.
[19] 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..
[20] Toniann Pitassi,et al. Value Elimination: Bayesian Interence via Backtracking Search , 2002, UAI.
[21] Russell Impagliazzo,et al. Memoization and DPLL: formula caching proof systems , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[22] Toniann Pitassi,et al. Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.
[23] Henry A. Kautz,et al. Heuristics for Fast Exact Model Counting , 2005, SAT.
[24] Manfred Jaeger,et al. Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..
[25] Eugene Goldberg,et al. BerkMin: A Fast and Robust Sat-Solver , 2002, Discret. Appl. Math..