"The Complexity of Theorem-Proving Procedures"
E321037
"The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| "The Complexity of Theorem-Proving Procedures" canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T3043207 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: "The Complexity of Theorem-Proving Procedures" Context triple: [Stephen Cook, notableWork, "The Complexity of Theorem-Proving Procedures"]
-
A.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
B.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
E.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: "The Complexity of Theorem-Proving Procedures" Target entity description: "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
-
A.
Handbook of Automated Reasoning
The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
-
B.
the Logic Theorist program
The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
-
C.
Vampire automated theorem prover
Vampire automated theorem prover is a high-performance first-order logic reasoning system widely used in automated deduction and formal verification research.
-
D.
Davis–Putnam algorithm
The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
-
E.
Recherches sur la théorie de la démonstration
Recherches sur la théorie de la démonstration is Jacques Herbrand’s foundational work in mathematical logic, introducing key results in proof theory and what is now known as Herbrand’s theorem.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
complexity theory paper
ⓘ
computer science paper ⓘ scientific paper ⓘ |
| alsoKnownAs |
Cook–Levin theorem
ⓘ
surface form:
Cook’s 1971 NP-completeness paper
|
| author |
Stephen A. Cook
ⓘ
Stephen Cook ⓘ |
| citationType | highly cited paper in theoretical computer science ⓘ |
| context | early development of complexity-theoretic classification of decision problems ⓘ |
| definesConcept |
NP-completeness
ⓘ
NP-hardness ⓘ |
| field |
computational complexity theory
ⓘ
mathematical logic ⓘ theoretical computer science ⓘ |
| hasLegacy |
catalyzed extensive research on NP-complete problems
ⓘ
established SAT as the first known NP-complete problem ⓘ foundation for the theory of NP-completeness ⓘ |
| historicalSignificance | one of the founding works of modern computational complexity theory ⓘ |
| influencedField |
algorithm design
ⓘ
computational complexity theory ⓘ logic in computer science ⓘ proof complexity ⓘ |
| language | English ⓘ |
| mainContribution |
establishment of SAT as a central problem in complexity theory
ⓘ
formalization of the class NP in terms of nondeterministic Turing machines ⓘ introduction of the concept of NP-completeness ⓘ proof that the Boolean satisfiability problem is NP-complete ⓘ |
| originalMedium | conference proceedings ⓘ |
| problemTypeStudied |
decision problems in propositional logic
ⓘ
theorem-proving procedures for formal systems ⓘ |
| publicationYear | 1971 ⓘ |
| publishedBy | Association for Computing Machinery ⓘ |
| publishedIn | Proceedings of the Third Annual ACM Symposium on Theory of Computing ⓘ |
| relatedConcept |
Cook–Levin theorem
ⓘ
P versus NP problem ⓘ decision problem ⓘ polynomial-time reduction ⓘ |
| result |
Cook–Levin theorem
ⓘ
surface form:
SAT is NP-complete
every problem in NP is polynomial-time reducible to SAT ⓘ |
| studiesComplexityClass | NP ⓘ |
| studiesProblem | Boolean satisfiability problem ⓘ |
| timeComplexityFocus |
nondeterministic polynomial time
ⓘ
polynomial time ⓘ |
| topic |
complexity of automated theorem proving
ⓘ
complexity of decision procedures in logic ⓘ |
| usesModelOfComputation | nondeterministic Turing machine ⓘ |
| usesTechnique | polynomial-time many-one reductions ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: "The Complexity of Theorem-Proving Procedures" Description of subject: "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.