3-SAT
E679892
3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
All labels observed (1)
| Label | Occurrences |
|---|---|
| 3-SAT canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T7666072 — 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: 3-SAT Context triple: [NP-completeness, hasCanonicalProblem, 3-SAT]
-
A.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
B.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
C.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
D.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
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.
- 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: 3-SAT Target entity description: 3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
-
A.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
B.
Max-SAT
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
C.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
D.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
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.
- F. None of above. chosen
Statements (46)
| Predicate | Object |
|---|---|
| instanceOf |
Boolean satisfiability problem
ⓘ
decision problem ⓘ |
| averageCaseStudy | phase transition in satisfiability around critical clause-to-variable ratios ⓘ |
| benchmarkRole |
benchmark for NP-completeness reductions
ⓘ
standard test problem in SAT solving ⓘ |
| canonicalStatus | canonical NP-complete problem ⓘ |
| clauseLength | 3 ⓘ |
| clauseType | disjunction of exactly three literals ⓘ |
| completeness | NP-complete ⓘ |
| complexityClass | NP NERFINISHED ⓘ |
| decisionQuestion | is the given 3-CNF formula satisfiable ⓘ |
| definedOver | Boolean formulas in conjunctive normal form ⓘ |
| field |
computational complexity theory
ⓘ
mathematical logic ⓘ theoretical computer science ⓘ |
| formulaType | conjunction of clauses ⓘ |
| generalizationOf | problems with clauses of at most three literals ⓘ |
| hardness | NP-hard ⓘ |
| historicalResult | first problems shown NP-complete via polynomial-time reduction from SAT ⓘ |
| importance |
central example in NP-completeness theory
ⓘ
fundamental benchmark in computational complexity theory ⓘ |
| inputEncoding | 3-CNF formula ⓘ |
| introducedIn | Cook–Levin theorem NERFINISHED ⓘ |
| optimizationVariant | MAX-3-SAT ⓘ |
| outputType | yes-no decision ⓘ |
| question | whether there exists a truth assignment that satisfies all clauses ⓘ |
| reductionType | polynomial-time many-one reduction ⓘ |
| relatedProblem |
2-SAT
ⓘ
3-CNF-SAT ⓘ MAX-3-SAT NERFINISHED ⓘ SAT ⓘ k-SAT ⓘ |
| representation | 3-CNF formula with n variables and m clauses ⓘ |
| restrictionOf | SAT NERFINISHED ⓘ |
| satisfiabilityType | exactly three literals per clause ⓘ |
| searchVariant | finding a satisfying assignment ⓘ |
| specialCaseOf | k-SAT for k = 3 ⓘ |
| statusIfPEqualsNP | would be solvable in polynomial time ⓘ |
| statusIfPNotEqualNP | believed not solvable in polynomial time ⓘ |
| typicalAlgorithmicApproach |
DPLL-based SAT solvers
ⓘ
backtracking search ⓘ local search algorithms ⓘ |
| typicalUse |
benchmark for SAT solver performance
ⓘ
starting point for NP-completeness proofs ⓘ |
| variableDomain | Boolean variables ⓘ |
| verificationProperty | candidate satisfying assignment can be verified in polynomial time ⓘ |
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: 3-SAT Description of subject: 3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.