ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Minimal unsatisfiable sets: Classification and bounds

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.

[img] PDF
Minimal_Unsatisfiable.pdf - Published Version
Restricted to Registered users only

Download (149kB) | Request a copy
Official URL: http://www.springerlink.com/content/hv5xvqk36lbggk...


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
Publisher: Springer
Additional Information: Copyright of this article belongs to Springer.
Keywords: Boolean formulas;propositional logic;satisfiability;Minimal Unsatisfiable Sets
Department/Centre: Division of Interdisciplinary Sciences > Centre for Biosystems Science and Engineering
Date Deposited: 08 Mar 2012 07:01
Last Modified: 30 Jan 2019 10:18
URI: http://eprints.iisc.ac.in/id/eprint/43770

Actions (login required)

View Item View Item