Algorithmadvanced
DPLL(T)
Also called lazy SMT by DPLL, DPLL modulo theories.
Runs DPLL on the Boolean skeleton and calls a theory solver to check the assigned theory atoms.
Runs DPLL on the Boolean skeleton and calls a theory solver to check the assigned theory atoms.
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 R9CQRP Edit this page History Report an error