Statements (21)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
gptkb:mathematical_optimization |
| gptkbp:generalizes |
gptkb:Max-SAT
gptkb:SAT |
| gptkbp:input |
Boolean formula in conjunctive normal form (CNF)
weights for each clause |
| gptkbp:involves |
weighted clauses
|
| gptkbp:is_NP-hard |
true
|
| gptkbp:objective |
maximize the sum of weights of satisfied clauses
|
| gptkbp:solvedBy |
approximation algorithms
branch and bound exact algorithms local search algorithms SAT-based solvers |
| gptkbp:used_in |
gptkb:artificial_intelligence
operations research bioinformatics circuit design |
| gptkbp:variant |
gptkb:Maximum_Satisfiability_Problem
Boolean Satisfiability Problem |
| https://www.w3.org/2000/01/rdf-schema#label |
Weighted Max-SAT
|