Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
gptkb:QSAT
|
| gptkbp:application |
gptkb:complexity_theory
theoretical computer science |
| gptkbp:complexity |
PSPACE-complete
|
| gptkbp:generalizes |
gptkb:SAT
|
| gptkbp:hasQuantifiers |
gptkb:military_decoration
existential |
| https://www.w3.org/2000/01/rdf-schema#label |
Quantified SAT
|
| gptkbp:input |
gptkb:quantified_Boolean_formula
|
| gptkbp:isHarderThan |
gptkb:SAT
|
| gptkbp:relatedTo |
gptkb:quantified_Boolean_formula
Boolean satisfiability problem |
| gptkbp:solvedBy |
QBF solvers
|
| gptkbp:studiedBy |
1970s
|
| gptkbp:type |
Is the formula true for all variable assignments?
|
| gptkbp:usedIn |
gptkb:artificial_intelligence
formal verification automated planning |
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|