The Complexity of Some Subclasses of Minimal Unsatis able Formulas

This paper is concerned with the complexity of some natural subclasses of minimal unsatisable formulas. We show the D P {completeness of the classes of maximal and marginal minimal unsatisable formulas. Then we consider the class Unique{MU of minimal unsatisable formulas which have after removing a clause exactly one satisfying truth assignment. We show that Unique{MU has the same complexity as the unique satisabilit y problem with respect to polynomial reduction. However, a slight modication of this class leads to the D P {completeness. Finally we show that the class of minimal unsatisable formulas which can be divided for every variable into two separate minimal unsatisable formulas is at least as hard as the unique satisabilit y problem.

[1]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[2]  Stefan Szeider,et al.  Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference , 2002, Theor. Comput. Sci..

[3]  Andreas Blass,et al.  On the Unique Satisfiability Problem , 1982, Inf. Control..

[4]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[5]  Oliver Kullmann,et al.  An application of matroid theory to the SAT problem , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[6]  Christos H. Papadimitriou,et al.  The complexity of facets resolved , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[7]  Hans Kleine Büning,et al.  An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF , 1998, Annals of Mathematics and Artificial Intelligence.

[8]  Kazuo Iwama,et al.  Intractability of read-once resolution , 1995, Proceedings of Structure in Complexity Theory. Tenth Annual IEEE Conference.

[9]  Alasdair Urquhart,et al.  Formal Languages]: Mathematical Logic--mechanical theorem proving , 2022 .

[10]  Jacobo Torán,et al.  Complexity classes defined by counting quantifiers , 1991, JACM.

[11]  Nathan Linial,et al.  Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas , 1986, J. Comb. Theory, Ser. A.