Handbook of Satisfiability¶
Biere, A., Heule, M., van Maaren, H., & 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¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:8e93ff7c6f7a · see in the full table