Proving the unsatisfiability of prepositional Boolean formulas has applications in a wide range of fields. Minimal Unsatisfiable Sets (MUS) are signatures of the property of unsatisfiability in formulas and our understanding of these signatures can be very helpful in answering various algorithmic and structural questions relating to unsatisfiability. In this paper, we explore some combinatorial properties of MUS and use them to devise a classification scheme for MUS. We also derive bounds on the sizes of MUS in Horn, 2-SAT and 3-SAT formulas. © Springer- Verlag Berlin Heidelberg 2004.
CITATION STYLE
Dasgupta, S., & Chandru, V. (2004). Minimal unsatisfiable sets: Classification and bounds. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3321, 330–342. https://doi.org/10.1007/978-3-540-30502-6_24
Mendeley helps you to discover research relevant for your work.