Chandru, Vijay and Dasgupta, Sudeshna (2005) Minimal unsatisfiable sets: Classification and bounds. In: 9th Asian Computing Science Conference, DEC 08-10, 2004, Chiang Mai, THAILAND.
Minimal_Unsatisfiable.pdf - Published Version
Restricted to Registered users only
Download (145Kb) | Request a copy
Proving the unsatisfiability of propositional 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.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Keywords:||Boolean formulas;propositional logic;satisfiability;Minimal Unsatisfiable Sets|
|Date Deposited:||08 Mar 2012 07:01|
|Last Modified:||08 Mar 2012 07:01|
Actions (login required)