Nathan Wetzler
Nathan Wetzler
Verified email at cs.utexas.edu - Homepage
Title
Cited by
Cited by
Year
DRAT-trim: Efficient checking and trimming using expressive clausal proofs
N Wetzler, MJH Heule, WA Hunt
International Conference on Theory and Applications of Satisfiability …, 2014
1442014
Trimming while checking clausal proofs
MJH Heule, WA Hunt, N Wetzler
2013 Formal Methods in Computer-Aided Design, 181-188, 2013
892013
Verifying refutations with extended resolution
MJH Heule, WA Hunt, N Wetzler
International Conference on Automated Deduction, 345-359, 2013
542013
Mechanical Verification of SAT Refutations with Extended Resolution
N Wetzler, MJH Heule, WA Hunt Jr
Interactive Theorem Proving (ITP) 7998, 229-244, 2013
322013
Expressing symmetry breaking in DRAT proofs
MJH Heule, WA Hunt, N Wetzler
International Conference on Automated Deduction, 591-606, 2015
312015
Efficient, verified checking of propositional proofs
M Heule, W Hunt, M Kaufmann, N Wetzler
International Conference on Interactive Theorem Proving, 269-284, 2017
262017
Bridging the gap between easy generation and efficient verification of unsatisfiability proofs
MJH Heule, WA Hunt Jr, N Wetzler
Software Testing, Verification and Reliability 24 (8), 593-607, 2014
192014
Partial words and the critical factorization theorem revisited
F Blanchet-Sadri, ND Wetzler
Theoretical Computer Science 385 (1-3), 179-192, 2007
142007
Efficient, mechanically-verified validation of satisfiability solvers
ND Wetzler
The University of Texas at Austin, 2015
52015
The system can't perform the operation now. Try again later.
Articles 1–9