Algorithmcore
Davis-Putnam procedure
Also called DP procedure, resolution-based DP.
Original SAT procedure that eliminates variables by resolution.
Original SAT procedure that eliminates variables by resolution.
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 1EV788 Edit this page History Report an error