---
title: "Who cites Chaff: Engineering an Efficient — 19 citing papers"
description: "19 papers of the Elamur Research library cite «Chaff: Engineering an Efficient SAT Solver», found in their bibliographies; the most cited first."
canonical: "https://research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/cited-by/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/cited-by/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [Chaff: Engineering an Efficient SAT Solver](https://md.research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/) / cited by

# 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»](https://md.research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/)

1. [**Automatic Generation of Peephole Superoptimizers ASPLOS 2006**Sorav Bansal, Alex Aiken*2006 · 180 citations*](https://md.research.elamur.ai/free/en/papers/bansal-2006-automatic-generation-peephole-superoptimizers/)
2. [**History of Interactive Theorem Proving Handbook of the History of Logic, vol. 9 (Elsevier)**John Harrison, Josef Urban, Freek Wiedijk*2014 · 109 citations*](https://md.research.elamur.ai/free/en/papers/harrison-2014-history-interactive-theorem-proving/)
3. [**Guiding High-Performance SAT Solvers with Unsat-Core Predictions arXiv:1903.04671 (International Conference on Theory and Applications of Satisfiability Testing. Springer, Cham, 2019)**Daniel Selsam, Nikolaj Bjørner*2019 · 16 citations*](https://md.research.elamur.ai/free/en/papers/selsam-2019-guiding-high-performance-sat-solvers/)
4. [**Learning Heuristics for Quantified Boolean Formulas through Deep Reinforcement Learning arXiv:1807.08058**Gil Lederman, Markus N. Rabe, Edward A. Lee, et al.*2018 · 12 citations*](https://md.research.elamur.ai/free/en/papers/lederman-2018-learning-heuristics-quantified-boolean-formulas/)
5. **[Methods for Constraint Solving Problems Based on Learn to Reason Model: A Review (基于学习-推理的约束求解方法研究进展)](https://md.research.elamur.ai/free/en/papers/zou-2023-methods-constraint-solving/) [Journal of Software](https://md.research.elamur.ai/free/en/venues/journal-of-software/)**Yue Zou (邹悦), Jiayang Lai (赖家洋), Yonggang Zhang (张永刚)*2023*
6. **[Exploiting Hidden Morphophonemic Constraints for Finding the Underlying Forms of ‘weak' Arabic Verbs](https://md.research.elamur.ai/free/en/papers/ramsay-2011-exploiting-hidden-morphophonemic-constraints-finding/) [Recent Advances in Natural Language Processing (RANLP)](https://md.research.elamur.ai/free/en/venues/ranlp/)**Allan Ramsay, Hanady Mansour*2011*

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

- [← back to](https://md.research.elamur.ai/free/en/papers/moskewicz-2001-chaff-engineering-efficient-sat-solver/) — Chaff: Engineering an Efficient SAT Solver