A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving

Stochastic Boolean Satisfiability (SSAT) is a powerful representation for the concise encoding of quantified decision problems with uncertainty. While it shares commonalities with quantified Boolean formula (QBF) satisfiability and has the same PSPACE-complete complexity, SSAT solving tends to be more challenging as it involves expensive model counting, a.k.a. Sharp-SAT. To date, SSAT solvers, especially those imposing no restrictions on quantification levels, remain much lacking. In this paper, we present a new SSAT solver based on the framework of clause selection and cube distribution previously proposed for QBF solving. With model counting integrated and learning techniques strengthened, our solver is general and effective. Experimental results demonstrate the overall superiority of the proposed algorithm in both solving performance and memory usage compared to the state-of-the-art solvers on a number of benchmark formu-

[1]  Moshe Y. Vardi,et al.  Optimizing a BDD-Based Modal Solver , 2003, CADE.

[2]  Michael L. Littman,et al.  The Computational Complexity of Probabilistic Planning , 1998, J. Artif. Intell. Res..

[3]  Supratik Chakraborty,et al.  Algorithmic Improvements in Approximate Counting for Probabilistic Inference: From Linear to Logarithmic SAT Calls , 2016, IJCAI.

[4]  Jie-Hong R. Jiang,et al.  Towards formal evaluation and verification of probabilistic design , 2014, 2014 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[5]  Jörg Hoffmann,et al.  From Sampling to Model Counting , 2007, IJCAI.

[6]  Jie-Hong Roland Jiang,et al.  Solving Stochastic Boolean Satisfiability under Random-Exist Quantification , 2017, IJCAI.

[7]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[8]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[9]  Jie-Hong Roland Jiang,et al.  Solving Exist-Random Quantified Stochastic Boolean Satisfiability via Clause Selection , 2018, IJCAI.

[10]  Jie-Hong R. Jiang,et al.  Dependency Stochastic Boolean Satisfiability: A Logical Formalism for NEXPTIME Decision Problems with Uncertainty , 2021, AAAI.

[11]  Georg Gottlob,et al.  Default Logic as a Query Language , 1997, IEEE Trans. Knowl. Data Eng..

[12]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[13]  Sanjit A. Seshia,et al.  Maximum Model Counting , 2017, AAAI.

[14]  Toniann Pitassi,et al.  Stochastic Boolean Satisfiability , 2001, Journal of Automated Reasoning.

[16]  Bart Selman,et al.  Model Counting: A New Strategy for Obtaining Good Bounds , 2006, AAAI.

[17]  Florian Lonsing,et al.  DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL , 2017, CADE.

[18]  Byron Boots,et al.  DC-SSAT: A Divide-and-Conquer Approach to Solving Stochastic Satisfiability Problems Efficiently , 2005, AAAI.

[19]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[20]  Mikolás Janota,et al.  Solving QBF by Clause Selection , 2015, IJCAI.

[21]  Christos H. Papadimitriou,et al.  Games against nature , 1985, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[22]  Gilles Audemard,et al.  Predicting Learnt Clauses Quality in Modern SAT Solvers , 2009, IJCAI.

[23]  Mate Soos,et al.  Tinted, Detached, and Lazy CNF-XOR Solving and Its Applications to Counting and Sampling , 2020, CAV.

[24]  Jie-Hong Roland Jiang,et al.  A Cube Distribution Approach to QBF Solving and Certificate Minimization , 2019, CP.