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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandru, V., Hooker, J.N.: Optimization Methods for Logical Inference. Wiley, New York (1999)
Chang, Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1987)
Büning, H.K., Lettman, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)
Jeroslow, R.G.: Logic-Based Decision Support - Mixed Integer Model Formulation. North-Holland, Amsterdam (1989)
Truemper, K.: Effective Logic Computation. Wiley, New York (1998)
Szeider, S., Fleischner, H., Kullmann, O.: Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference. Theoretical Computer Science 289(1), 503–516 (2002), Draft version (updated August 2001)
Bruni, R., Sassano, A.: Finding Minimal Unsatisfiable Subformulae in Satisfiability Instances. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, p. 495. Springer, Heidelberg (2000)
Hooker, J.N., Rago, G., Chandru, V., Shrivastava, A.: Partial instantiation methods for inference in first order logic. Journal of Automated Reasoning 28, 371–396 (2002)
Büening, H.K., Xishun, Z.: Minimal Unsatisfiability:Results and Open Questions, a technical report available at http://www.uni-paderborn.de/cs/ag-klbue/projects/index.html
Kullman, O.: On some Connections between Linear Algebra and the Combinatorics of Clause-sets. In: SAT 2003 informal proceedings, available at http://www.cs.swan.ac.uk/~csoliver/papers.html
Szeider, S.: Acyclic Formulas and Minimal Unsatisfiability (September 2000), available at http://www.cs.toronto.edu/~szeider/
Dasgupta, S.: A Declarative Constraint Logic Programming Language based on Partial Instantiation Technique for Inference, Ph.D. Dissertation, Birla Institute of Technology and Science, Pilani, Rajasthan, India (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dasgupta, S., Chandru, V. (2004). Minimal Unsatisfiable Sets: Classification and Bounds. In: Maher, M.J. (eds) Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making. ASIAN 2004. Lecture Notes in Computer Science, vol 3321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30502-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-30502-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24087-7
Online ISBN: 978-3-540-30502-6
eBook Packages: Computer ScienceComputer Science (R0)