29 citations · 78 across the 10 of their papers we have counts for
4 papers · 1 filter
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…
Reducing SAT to Max2XOR
Carlos Ansótegui, Jordi Levy
Representing some problems with XOR clauses (parity constraints) can allow to apply more efficient reasoning techniques. In this paper, we present a gadget for translating SAT clau…
Community Structure in Industrial SAT Instances
Carlos Ansótegui, Maria Luisa Bonet, Jesús Giráldez-Cru +2
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental process. It is…
The Fractal Dimension of SAT Formulas
C. Ansótegui, M. L. Bonet, J. Giráldez-Cru +1
Modern SAT solvers have experienced a remarkable progress on solving industrial instances. Most of the techniques have been developed after an intensive experimental testing proces…