A new method for solving hard satisfiability problems

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

The complexity of theorem-proving procedures

1971 • 6,155 citations

A Computing Procedure for Quantification Theory

1960 • 2,592 citations

Planning as satisfiability

1992 • 861 citations

Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning

1991 • 836 citations

Hard and easy distributions of SAT problems

1992 • 815 citations

On selecting a satisfying truth assignment

2002 • 247 citations

Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem

1983 • 235 citations

Making believers out of computers

1986 • 234 citations

Model Checking vs. Theorem Proving: A Manifesto

1991 • 180 citations

Efficient local search for very large-scale satisfiability problems

1992 • 156 citations

A logical framework for depiction and image interpretation

1989 • 152 citations

A continuous approach to inductive inference

1992 • 104 citations

A discrete stochastic neural network algorithm for constraint satisfaction problems

1990 • 101 citations

On the greedy algorithm for satisfiability

1992 • 95 citations

Resolution vs. cutting plane solution of inference problems: Some computational experience

1988 • 80 citations

A note on the queen's problem

1986 • 32 citations

The complexity of automated reasoning

1990 • 16 citations