Stochastic Boolean Satisfiability (SSAT) is a powerful representation for the concise encoding of quantified decision problems with uncertainty. While it shares commonalities formula (QBF) satisfiability and has same PSPACE-complete complexity, SSAT solving tends to be more challenging as involves expensive model counting, a.k.a. Sharp-SAT. To date, solvers, especially those imposing no restric...

We characterise piecewise Boolean domains, that is, those domains that arise as Boolean subalgebras of a piecewise Boolean algebra. This leads to equivalent descriptions of the category of piecewise Boolean algebras: either as piecewise Boolean domains equipped with an orientation, or as full structure sheaves on piecewise Boolean domains.