General Boolean Formula Minimization with QBF Solvers

Eduardo Calò, Jordi Levy

The minimization of propositional formulae is a classical problem in logic, whose first algorithms date back at least to the 1950s with the works of Quine and Karnaugh. Most previo…