Seeking Practical CDCL Insights from Theoretical SAT Benchmarks

@inproceedings{Elffers2018SeekingPC,
  title={Seeking Practical CDCL Insights from Theoretical SAT Benchmarks},
  author={Jan Elffers and Jes{\'u}s Gir{\'a}ldez-Cru and Stephan Gocht and Jakob Nordstr{\"o}m and Laurent Simon},
  booktitle={IJCAI},
  year={2018}
}
Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning (CDCL) have developed to the point where they can handle formulas with millions of variables. Yet ... 

References

Publications referenced by this paper.
SHOWING 1-10 OF 49 REFERENCES

Narrow Proofs May Be Maximally Long

  • IEEE Conference on Computational Complexity
  • 2014
VIEW 12 EXCERPTS

Empirical study of the anatomy of modern SAT solvers

H. Katebi, K. A. Sakallah, J. P. MarquesSilva
  • Proc. 14th Conf. Theory Appl. Sat. Testing (SAT’11), pp. 343–356
  • 2011
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution

  • 2008 49th Annual IEEE Symposium on Foundations of Computer Science
  • 2008
VIEW 4 EXCERPTS

Chaff: engineering an efficient SAT solver

  • Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
  • 2001
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL