Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints¶
Liffiton, M. H., & Sakallah, K. A. (2008). Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints. Journal of Automated Reasoning, 40(1), 1-33.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Minimal Unsat Core Analysis
- Its strength is diagnostic focus: a minimal unsatisfiable subset
This sourceComputes minimal unsatisfiable subsets that isolate a minimal collection of constraints responsible for inconsistency.
- Its strength is diagnostic focus: a minimal unsatisfiable subset
- Minimal Unsatisfiable Core Extraction
- Its central trap is that cores are not unique: the one you extract is a minimal conflict, not the cause, and resolving it does not guarantee satisfiability — a second, independent core may remain, so a set can stay infeasible after the "fix."
This sourceEstablishes that an unsatisfiable system can contain multiple minimal unsatisfiable subsets, so addressing one core need not exhaust the remaining conflict.
- Its central trap is that cores are not unique: the one you extract is a minimal conflict, not the cause, and resolving it does not guarantee satisfiability — a second, independent core may remain, so a set can stay infeasible after the "fix."
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
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:1e3a84da362d · see in the full table