Abstract: Several algorithms are presented, more or less directly related to the "minimization" theory of Boolean formulas. They give solutions to the following specific problems: computation of the ...

Quantified Boolean formulas (QBFs) extend propositional logic by interleaving existential and universal quantifiers over Boolean variables, providing a natural framework for expressing problems in ...

description [AAAI 2026][DQBF] This paper presents the first study of the model counting problem for Dependency Quantified Boolean Formulas (DQBF). It proves that #2-DQBF — restricted to only two ...

Weighted Model counting (WMC) is a fundamental problem in computer science with a wide variety of applications in practice, ranging from neural network verification to network reliability. The current ...

The explosion in artificial intelligence (AI) and machine learning applications is permeating nearly every industry and slice of life. But its growth does not come without irony. While AI exists to ...

Advances in SAT solver technology have enabled many automated analysis and reasoning tools to reduce their input problem to a SAT problem, and then to use an efficient SAT solver to solve the ...

Accepts formulas in an (almost) SMT-LIBv2 format, see full details below. Tested and compared against Z3 over more than four million random formulas. Surprisingly, it is quite faster than Z3 on short ...

Given a Boolean formula over many variables, how should the variables be set in order to make the formula true? This is a fundamental--indeed, the original--NP-complete problem. Many practical ...