Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:application |
gptkb:artificial_intelligence
automated theorem proving circuit design |
| gptkbp:complexity |
NP-complete
|
| gptkbp:definedIn |
determining if there exists an interpretation that satisfies a given logical formula
|
| gptkbp:field |
gptkb:logic
computer science |
| gptkbp:hasVariant |
gptkb:3-SAT
gptkb:Horn-SAT gptkb:k-SAT |
| https://www.w3.org/2000/01/rdf-schema#label |
Satisfiability problem
|
| gptkbp:relatedTo |
gptkb:logic
Boolean satisfiability problem |
| gptkbp:solvedBy |
Boolean satisfiability problem
|
| gptkbp:studiedBy |
20th century
|
| gptkbp:bfsParent |
gptkb:Exponential_Time_Hypothesis
gptkb:Quantified_Boolean_Formula |
| gptkbp:bfsLayer |
7
|