SAT problem
E512973
The SAT problem is a fundamental NP-complete decision problem in computer science that asks whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
All labels observed (1)
| Label | Occurrences |
|---|---|
| SAT problem canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T5335898 — 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: SAT problem Context triple: [P, NP, and NP-Completeness: The Basics of Complexity Theory, mainTopic, SAT problem]
-
A.
SAT
SAT is Mexico’s federal tax administration authority responsible for collecting taxes, overseeing customs, and enforcing fiscal regulations.
-
B.
SAT
The SAT is a standardized college admissions test widely used in the United States to assess high school students' readiness for undergraduate study.
-
C.
SAT
SAT is the three-letter IATA airport code for San Antonio International Airport, a major commercial airport serving San Antonio, Texas.
-
D.
UP College Admission Test
The UP College Admission Test is a highly competitive standardized exam used to select incoming students for the University of the Philippines, the country’s premier public university system.
-
E.
PSAT/NMSQT
The PSAT/NMSQT is a standardized, preliminary version of the SAT taken by high school students in the United States that also serves as the qualifying test for the National Merit Scholarship Program.
- 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: SAT problem Target entity description: The SAT problem is a fundamental NP-complete decision problem in computer science that asks whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
A.
SAT
SAT is Mexico’s federal tax administration authority responsible for collecting taxes, overseeing customs, and enforcing fiscal regulations.
-
B.
SAT
The SAT is a standardized college admissions test widely used in the United States to assess high school students' readiness for undergraduate study.
-
C.
SAT
SAT is the three-letter IATA airport code for San Antonio International Airport, a major commercial airport serving San Antonio, Texas.
-
D.
UP College Admission Test
The UP College Admission Test is a highly competitive standardized exam used to select incoming students for the University of the Philippines, the country’s premier public university system.
-
E.
PSAT/NMSQT
The PSAT/NMSQT is a standardized, preliminary version of the SAT taken by high school students in the United States that also serves as the qualifying test for the National Merit Scholarship Program.
- F. None of above. chosen
Statements (54)
| Predicate | Object |
|---|---|
| instanceOf |
Boolean satisfiability problem
ⓘ
NP-complete problem ⓘ computational problem ⓘ decision problem ⓘ |
| abbreviation | SAT ⓘ |
| alsoKnownAs | Boolean satisfiability problem ⓘ |
| asksWhether | there exists a truth assignment that makes a Boolean formula evaluate to true ⓘ |
| canonicalReference | Cook–Levin theorem ⓘ |
| certificate | satisfying assignment of variables ⓘ |
| complexityClass | NP ⓘ |
| complexityOf2SAT | solvable in polynomial time ⓘ |
| complexityOf3SAT | NP-complete ⓘ |
| complexityOfHornSAT | solvable in polynomial time ⓘ |
| complexityOfkSATForK≥3 | NP-complete ⓘ |
| field |
computational complexity theory
ⓘ
computer science ⓘ theoretical computer science ⓘ |
| firstNPCompleteProblem | true ⓘ |
| hasAlgorithmicApproach |
CDCL SAT solvers
ⓘ
linked to:
CDCL SAT solver
DPLL algorithm ⓘ
linked to:
Davis–Putnam algorithm
backtracking search ⓘ local search SAT solvers ⓘ |
| hasPolynomialTimeAlgorithm | unknown ⓘ |
| input | Boolean formula ⓘ |
| inputRepresentation |
arbitrary Boolean formula over variables and connectives
ⓘ
conjunctive normal form ⓘ disjunctive normal form ⓘ |
| isCompleteFor | class NP under polynomial-time many-one reductions ⓘ |
| isInNP | true ⓘ |
| isNPComplete | true ⓘ |
| isNPHard | true ⓘ |
| logicalConnectives |
AND
ⓘ
NOT ⓘ OR ⓘ |
| NPCompletenessProvedBy | Stephen Cook ⓘ |
| NPCompletenessProvedIndependentlyBy | Leonid Levin ⓘ |
| output | YES if the formula is satisfiable, NO otherwise ⓘ |
| relatedOpenProblem | P versus NP problem ⓘ |
| restriction |
2-SAT
ⓘ
3-SAT ⓘ Horn-SAT ⓘ k-SAT ⓘ monotone SAT ⓘ planar SAT ⓘ |
| usedFor | reductions in NP-completeness proofs ⓘ |
| usedIn |
artificial intelligence
ⓘ
automated theorem proving ⓘ constraint solving ⓘ hardware verification ⓘ software verification ⓘ |
| valueDomain | truth values true and false ⓘ |
| variableDomain | Boolean variables ⓘ |
| verificationTime | polynomial time given a candidate assignment ⓘ |
| yearNPCompletenessProved | 1971 ⓘ |
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: SAT problem Description of subject: The SAT problem is a fundamental NP-complete decision problem in computer science that asks whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.