4 citations · 4 across the 1 of their papers we have counts for
2 papers
cs.LO2019
On CDCL-based proof systems with the ordered decision strategy
Nathan Mull, Shuo Pang, Alexander Razborov
We prove that conflict-driven clause learning SAT-solvers with the ordered decision strategy and the DECISION learning scheme are equivalent to ordered resolution. We also prove th…
cs.LO2016★ 4 cited
On the Hardness of SAT with Community Structure
Nathan Mull, Daniel J. Fremont, Sanjit A. Seshia
Recent attempts to explain the effectiveness of Boolean satisfiability (SAT) solvers based on conflict-driven clause learning (CDCL) on large industrial benchmarks have focused on…