Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection
暂无分享,去创建一个
[1] Jinbo Huang,et al. Combining Knowledge Compilation and Search for Conformant Probabilistic Planning , 2006, ICAPS.
[2] Supratik Chakraborty,et al. Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls , 2016, IJCAI.
[3] Markus N. Rabe,et al. CAQE: A Certifying QBF Solver , 2015, 2015 Formal Methods in Computer-Aided Design (FMCAD).
[4] Toniann Pitassi,et al. Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.
[5] Adnan Darwiche,et al. Decomposable negation normal form , 2001, JACM.
[6] Sanjit A. Seshia,et al. Maximum Model Counting , 2017, AAAI.
[7] Christos H. Papadimitriou,et al. Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[8] Niklas Sörensson,et al. An Extensible SAT-solver , 2003, SAT.
[9] Jie-Hong Roland Jiang,et al. Solving Stochastic Boolean Satisfiability under Random-Exist Quantification , 2017, IJCAI.
[10] Toniann Pitassi,et al. Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.
[11] Mikolás Janota,et al. Solving QBF by Clause Selection , 2015, IJCAI.
[12] Michael L. Littman,et al. MAXPLAN: A New Approach to Probabilistic Planning , 1998, AIPS.
[13] Niklas Sörensson,et al. Temporal induction by incremental SAT solving , 2003, BMC@CAV.
[14] Henry A. Kautz,et al. Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.
[15] Roberto Rossi,et al. A Survey on CP-AI-OR Hybrids for Decision Making Under Uncertainty , 2011 .
[16] Jie-Hong R. Jiang,et al. Towards formal evaluation and verification of probabilistic design , 2014, ICCAD 2014.
[17] Rina Dechter,et al. Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.
[18] Byron Boots,et al. DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently , 2005, AAAI.
[19] Pierre Marquis,et al. A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..
[20] Donald W. Loveland,et al. A machine program for theorem-proving , 2011, CACM.
[21] Adnan Darwiche,et al. A compiler for deterministic, decomposable negation normal form , 2002, AAAI/IAAI.
[22] Michael L. Littman,et al. The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..
[23] Adnan Darwiche,et al. A New d-DNNF-Based Bound Computation Algorithm for Functional E-MAJSAT , 2009, IJCAI.
[24] Adnan Darwiche,et al. On probabilistic inference by weighted model counting , 2008, Artif. Intell..