Communications of the ACM · 2023 · 19 citations · 21 references
ComputingComputer ScienceAlgorithmsTheory Of ComputationComputational ComplexityConstraint SatisfactionConstraint SolvingBoolean SatisfiabilityBoolean Satisfiability ProblemSatisfiability
Today's powerful, robust SAT solvers have become primary tools for solving hard computational problems.
21
Graph-Based Algorithms for Boolean Function Manipulation
Bryant · IEEE Transactions on Computers · 1986 · 8.9K citations · Full text
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
The Art of Computer Programming
G.E. Whitesides · Nuclear Science and Engineering · 1970 · 6.1K citations
A machine program for theorem-proving
Martin Davis, George Logemann, Donald Loveland · Communications of the ACM · 1962 · 3.2K citations · Full text
A Computing Procedure for Quantification Theory
Martin Davis, Hilary Putnam · Journal of the ACM · 1960 · 2.6K citations · Full text