Problemcore
Partial MaxSAT
Also called partial maximum satisfiability.
Hard clauses must be satisfied while soft clauses are maximized.
Hard clauses must be satisfied while soft clauses are maximized.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag ZXRJVG Edit this page History Report an error