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¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- 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¶
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:1e3a84da362d · see in the full table