🔗 Who cites «Chaff: Engineering an Efficient SAT Solver»

19 papers of our library cite it (of the 149,439 whose bibliographies we read) · 6 with a page here, the most cited first · ← back to «Chaff: Engineering an Efficient SAT Solver»

1. Automatic Generation of Peephole SuperoptimizersASPLOS 2006Sorav Bansal, Alex Aiken2006 · 180 citations
2. History of Interactive Theorem ProvingHandbook of the History of Logic, vol. 9 (Elsevier)John Harrison, Josef Urban, Freek Wiedijk2014 · 109 citations
3. Guiding High-Performance SAT Solvers with Unsat-Core PredictionsarXiv:1903.04671 (International Conference on Theory and Applications of Satisfiability Testing. Springer, Cham, 2019)Daniel Selsam, Nikolaj Bjørner2019 · 16 citations
4. Learning Heuristics for Quantified Boolean Formulas through Deep Reinforcement LearningarXiv:1807.08058Gil Lederman, Markus N. Rabe, Edward A. Lee, et al.2018 · 12 citations
5. Methods for Constraint Solving Problems Based on Learn to Reason Model: A Review (基于学习-推理的约束求解方法研究进展)Journal of SoftwareYue Zou (邹悦), Jiayang Lai (赖家洋), Yonggang Zhang (张永刚)2023
6. Exploiting Hidden Morphophonemic Constraints for Finding the Underlying Forms of ‘weak' Arabic VerbsRecent Advances in Natural Language Processing (RANLP)Allan Ramsay, Hanady Mansour2011

13 more papers of our library cite it; they have no page here yet.

This page in Markdown → https://md.research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/cited-by/