19 citations · 19 across the 4 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.CC2026
Associativity of Multiplication Is Hard for Resolution
Vincent Liew
SAT solvers are empirically known to perform poorly when reasoning about multiplication. Yet for over a decade we have lacked a theoretical explanation for this phenomenon. CDCL SA…
cs.CC2026
Proofdoors and Efficiency of CDCL Solvers
Sunidhi Singh, Vincent Liew, Marc Vinyals +1
We propose a new parameter called proofdoor in an attempt to explain the efficiency of CDCL SAT solvers over a certain class of formulas derived from circuit (esp., arithmetic) ver…