Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:defines |
A variant of the Max-SAT problem where some clauses are hard (must be satisfied) and others are soft (to be satisfied as much as possible).
|
| gptkbp:generalizes |
gptkb:Max-SAT
gptkb:SAT |
| gptkbp:hasApplication |
bioinformatics
resource allocation circuit design scheduling constraint satisfaction |
| https://www.w3.org/2000/01/rdf-schema#label |
Partial Max-SAT
|
| gptkbp:relatedTo |
gptkb:Max-SAT
gptkb:SAT Boolean satisfiability problem |
| gptkbp:supportsAlgorithm |
local search
branch and bound SAT-based encoding |
| gptkbp:usedIn |
gptkb:artificial_intelligence
operations research theoretical computer science |
| gptkbp:bfsParent |
gptkb:Max-SAT
|
| gptkbp:bfsLayer |
7
|