Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Understanding CDCL Solvers via Scalability Studies and Proofdoors
Shimin Zhang, Yechuan Xia, Chunxiao Li +3
Over the past several decades, CDCL SAT solvers have proven remarkably effective on large industrial formulas, despite SAT being NP-complete and widely believed to be intractable.…
cs.LO2024
A Reinforcement Learning based Reset Policy for CDCL SAT Solvers
Chunxiao Li, Charlie Liu, Jonathan Chung +3
Restart policy is an important technique used in modern Conflict-Driven Clause Learning (CDCL) solvers, wherein some parts of the solver state are erased at certain intervals durin…
cs.LO2021
On the Hierarchical Community Structure of Practical Boolean Formulas
Chunxiao Li, Jonathan Chung, Soham Mukherjee +5
Modern CDCL SAT solvers easily solve industrial instances containing tens of millions of variables and clauses, despite the theoretical intractability of the SAT problem. This gap…