Concepedia

MUSer2: An Efficient MUS Extractor1

Anton Belov, João Marques‐Silva

Journal on Satisfiability Boolean Modeling and Computation · 2012 · 67 citations · 11 references

DOIFull text

Open access

Concepts

Abstract

Algorithms for extraction of Minimally Unsatisfiable Subformulas (MUSes) of CNF formulas find a wide range of practical applications, including product configuration, knowledge-based validation, hardware and software design and verification. This pap

References

11

QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems

Ulrich Junker · 2004 · 380 citations

, , +15

Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

Mark H. Liffiton, Karem A. Sakallah · Journal of Automated Reasoning · 2007 · 328 citations

, , +9

Validating SAT Solvers Using an Independent Resolution-Based Checker: Practical Implementations and Other Applications

Lintao Zhang, Sharad Malik · 2003 · 271 citations

, , +9

Locating Minimal Infeasible Constraint Sets in Linear Programs

John W. Chinneck, Erik W. Dravnieks · INFORMS Journal on Computing · 1991 · 264 citations

, , +5

The complexity of facets resolved

Christos H. Papadimitriou, David Wolfe · Journal of Computer and System Sciences · 1988 · 207 citations · Full text

, , +9