|
gptkbp:instanceOf
|
theoretical computer science
Boolean satisfiability problem
|
|
gptkbp:alsoKnownAs
|
gptkb:SAT
CNF satisfiability
|
|
gptkbp:basisFor
|
many NP-completeness reductions
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:describedBy
|
gptkb:Cook-Levin_theorem
|
|
gptkbp:equivalentTo
|
gptkb:SAT
|
|
gptkbp:firstProvedNPCompleteBy
|
gptkb:Stephen_Cook
|
|
gptkbp:firstProvedNPCompleteIn
|
1971
|
|
gptkbp:generalizes
|
gptkb:2-SAT
gptkb:Horn-SAT
|
|
gptkbp:hasSpecialCase
|
gptkb:3-SAT
gptkb:2-SAT
gptkb:Horn-SAT
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
CNF-SAT
|
|
gptkbp:input
|
Boolean formula in conjunctive normal form
|
|
gptkbp:isHarderThan
|
gptkb:2-SAT
gptkb:Horn-SAT
|
|
gptkbp:output
|
NO if formula is not satisfiable
YES if formula is satisfiable
|
|
gptkbp:relatedTo
|
gptkb:3-SAT
gptkb:conjunctive_normal_form
Boolean formula
|
|
gptkbp:solvedBy
|
gptkb:SAT_solvers
|
|
gptkbp:usedIn
|
gptkb:artificial_intelligence
gptkb:complexity_theory
theoretical computer science
automated theorem proving
software verification
hardware verification
|
|
gptkbp:bfsParent
|
gptkb:Horn-SAT
|
|
gptkbp:bfsLayer
|
7
|