Handbook of Satisfiability¶
Biere, A., Heule, M., Maaren, H. v., & Walsh, T. (2009). Handbook of Satisfiability. IOS Press.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Consistency
- This "shrink to the conflict" move is the shared engine of SAT solvers, type checkers, constraint propagators, and proof assistants
This sourceReference on SAT solving, unsatisfiable cores, and the minimal-conflict-set localization used by constraint engines.
- This "shrink to the conflict" move is the shared engine of SAT solvers, type checkers, constraint propagators, and proof assistants
- Proof By Contradiction
- In formal verification solvers prove unsatisfiability — the negation has no model — which is exactly proof by contradiction at scale.
This sourceSAT solvers establish validity by proving the negation unsatisfiable — proof by contradiction mechanized at scale.
- In formal verification solvers prove unsatisfiability — the negation has no model — which is exactly proof by contradiction at scale.
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:8e93ff7c6f7a · see in the full table