boolean satisfiability problem
GPTKB entity
Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:abbreviation |
gptkb:SAT
|
| gptkbp:application |
gptkb:artificial_intelligence
circuit design theorem proving software verification |
| gptkbp:complexity |
NP-complete
|
| gptkbp:describedBy |
gptkb:Cook's_theorem
|
| gptkbp:field |
gptkb:logic
computer science |
| gptkbp:firstNPCompleteProblem |
yes
|
| gptkbp:hasSpecialCase |
gptkb:3-SAT
gptkb:2-SAT gptkb:k-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
boolean satisfiability problem
|
| gptkbp:input |
Boolean formula
|
| gptkbp:introduced |
gptkb:Stephen_Cook
|
| gptkbp:introducedIn |
1971
|
| gptkbp:output |
satisfiable or unsatisfiable
|
| gptkbp:relatedTo |
gptkb:logic
gptkb:P_vs_NP_problem Boolean satisfiability problem |
| gptkbp:solvedBy |
gptkb:CDCL_algorithm
gptkb:DPLL_algorithm gptkb:SAT_solvers |
| gptkbp:bfsParent |
gptkb:Davis–Putnam_algorithm
gptkb:Boolean_satisfiability_problem |
| gptkbp:bfsLayer |
6
|