the open
    research
    Contribute
    Back to the reading lists

    Classic AI: search, logic & planning· 2001

    Chaff: Engineering an Efficient SAT Solver

    Matthew W. Moskewicz (first author) · 2001

    Read the original

    DOI 10.1145/378239.379017OpenAlex W4233090747

    On the reading lists

    Why it matters

    Revolutionized practical SAT solving through efficient propagation and branching heuristics.

    Condensed from the expert lists' notes.

    The record

    First released
    2001 (from oracle lists)
    Citations
    2,944 citations, as counted by OpenAlex (CC0)
    Named by
    both expert lists
    Score
    0.288 · computed rank 633 · consensus 0.085, must-read 0, citations percentile 0.75 (2000s · classic-ai), awards 0, existing lists 0. Method

    Data sources

    Catalogue data from OpenAlex (CC0), Crossref (CC0 metadata; no abstracts are shown), arXiv, and Papers With Code (CC BY-SA 4.0). Each count names its source. See the method.