Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:alsoKnownAs |
gptkb:Partial_Satisfiability_Problem
|
| gptkbp:application |
gptkb:artificial_intelligence
theoretical computer science constraint satisfaction |
| gptkbp:citation |
gptkb:Papadimitriou,_C._H._(1994)._Computational_Complexity.
|
| gptkbp:complexity |
NP-complete
|
| gptkbp:defines |
Given a Boolean formula and an integer k, is there a truth assignment that satisfies at least k clauses?
|
| gptkbp:generalizes |
gptkb:SAT_problem
|
| https://www.w3.org/2000/01/rdf-schema#label |
Partial SAT
|
| gptkbp:relatedTo |
Boolean satisfiability problem
|
| gptkbp:solvedBy |
approximation algorithms
heuristic algorithms |
| gptkbp:studiedBy |
1990s
|
| gptkbp:subspecies |
gptkb:SAT_problem
|
| gptkbp:bfsParent |
gptkb:Boolean_satisfiability_problem
|
| gptkbp:bfsLayer |
6
|