CDCL SAT solvers compute small proofdoors on linearly scaling BMC families but large non-absorbed ones on exponential families, as shown by empirical measurements on a 76k+ instance benchmark where prior parameters fail to discriminate regimes.
The Complexity of Theorem- Proving Procedures
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
A new hypergraph-based GNN framework with polarity decomposition and consistency regularization is proposed for unsat core prediction in SAT.
citing papers explorer
No citing papers match the current filters.