25 citations · 79 across the 35 of their papers we have counts for
1 paper · 2 filters
Nachum Dershowitz, Iddo Tzameret
We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has…