Problemadvanced
Minimal correction subset
Also called MCS.
Smallest set of clauses whose removal makes the formula satisfiable.
Smallest set of clauses whose removal makes the formula satisfiable.
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 W95AD0 Edit this page History Report an error