Problemcore
Horn-SAT
Also called Horn formula satisfiability.
SAT where each clause has at most one positive literal; solvable in linear time.
SAT where each clause has at most one positive literal; solvable in linear time.
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 6XE08Y Edit this page History Report an error