Sciweavers

198
Voted
SAT
2005
Springer
129views Hardware» more  SAT 2005»
16 years 14 days ago
On Finding All Minimally Unsatisfiable Subformulas
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
Mark H. Liffiton, Karem A. Sakallah