|
gptkbp:instanceOf
|
theoretical computer science
|
|
gptkbp:abbreviation
|
gptkb:SAT
|
|
gptkbp:category
|
gptkb:logic
theoretical computer science
|
|
gptkbp:complexity
|
NP-complete
|
|
gptkbp:field
|
gptkb:logic
computer science
|
|
gptkbp:firstNPCompleteProblem
|
yes
|
|
gptkbp:fullName
|
Boolean satisfiability problem
|
|
gptkbp:generalizes
|
gptkb:3-SAT
gptkb:2-SAT
|
|
gptkbp:hasVariant
|
gptkb:3-SAT
gptkb:2-SAT
gptkb:k-SAT
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
SAT problem
|
|
gptkbp:input
|
Boolean formula
|
|
gptkbp:introduced
|
gptkb:Stephen_Cook
gptkb:The_Complexity_of_Theorem-Proving_Procedures
|
|
gptkbp:introducedIn
|
1971
|
|
gptkbp:output
|
yes/no
|
|
gptkbp:relatedTo
|
gptkb:P_vs_NP_problem
|
|
gptkbp:solvedBy
|
gptkb:CDCL_algorithm
gptkb:DPLL_algorithm
gptkb:SAT_solvers
brute-force search
|
|
gptkbp:type
|
Is there an assignment of variables that makes a Boolean formula true?
|
|
gptkbp:usedIn
|
gptkb:artificial_intelligence
automated theorem proving
software verification
hardware verification
constraint satisfaction
|
|
gptkbp:bfsParent
|
gptkb:P_vs_NP_problem
|
|
gptkbp:bfsLayer
|
5
|