1 citations · 1 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2023★ 1 cited
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…
cs.AI2022
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…