Yu-Wei Fan

2 accepted papers

2024

Unifying Decision and Function Queries in Stochastic Boolean Satisfiability

AAAI 2024technical

Stochastic Boolean satisfiability (SSAT) is a natural formalism for optimization under uncertainty. Its decision version implicitly imposes a final threshold quantification on an SSAT formula. However, the single threshold quantification restricts the expressive power of SSAT. In this work, we enric…

Cited by 3 Source ↗PDF ↗code ↗Scholar ↗

2023

SharpSSAT: A Witness-Generating Stochastic Boolean Satisfiability Solver

Yu-Wei Fan, Jie-Hong R. Jiang

AAAI 2023technical

Stochastic Boolean satisfiability (SSAT) is a formalism allowing decision-making for optimization under quantitative constraints. Although SSAT solvers are under active development, existing solvers do not provide Skolem-function witnesses, which are crucial for practical applications. In this work,…

Cited by 6 Source ↗PDF ↗code ↗Scholar ↗