Pei-Wei Chen

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 mo…