Discrete Applied Mathematics · 2006 · 22 citations · 28 references
ComputingComputer ScienceAlgorithmsKnowledge RepresentationLogicAutomated ReasoningConstraint SatisfactionDeductive ReasoningPropositional LogicBoolean SatisfiabilityBoolean Satisfiability ProblemSatisfiabilitySatisfiability Problem
28
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A machine program for theorem-proving
Martin Davis, George Logemann, Donald Loveland · Communications of the ACM · 1962 · 3.2K citations · Full text
Matthew W. Moskewicz, Conor Madigan, Ying Zhao et al. · 2001 · 2.9K citations
The Complexity of Flowshop and Jobshop Scheduling
M. R. Garey, David Johnson, Ravi Sethi · Mathematics of Operations Research · 1976 · 2.6K citations
Fast planning through planning graph analysis
Avrim Blum, Merrick L. Furst · Artificial Intelligence · 1997 · 1.6K citations