Minimal unsatisfiable sets: classification and bounds

Authors:
Sudeshna Dasgupta;Vijay Chandru
Affiliations:
Department of Computer Science, Mount Carmel College, Bangalore, India;Indian Institute of Science & Strand Genomics, Bangalore, India
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 4
Cited 1

Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
Partial Instantiation Methods for Inference in First-Order Logic

Journal of Automated Reasoning
Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference

Theoretical Computer Science
Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances

CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming

A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.