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

A formula (in conjunctive normal form) is said to be minimal unsatisfiable if it is unsatisfiable and deleting any clause makes it satisfiable. The deficiency of a formula is the difference of the number of clauses and the number of variables. It is known that every minimal unsatisfiable formula has positive deficiency. Until recently, polynomial-time algorithms were known to recognize minimal unsatisfiable formulas with deficiency 1 and 2. We state an algorithm which recognizes minimal unsatisfiable formulas with any fixed deficiency in polynomial time.

[1]  Hans Kleine Büning,et al.  On subclasses of minimal unsatisfiable formulas , 2000, Discret. Appl. Math..

[2]  Hans Kleine Büning,et al.  An Upper Bound for Minimal Resolution Refutations , 1998, CSL.

[3]  Zvi Galil,et al.  Efficient Algorithms for Finding Maximal Matching in Graphs , 1983, CAAP.

[4]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Oliver Kullmann,et al.  Investigations on autark assignments , 2000, Discret. Appl. Math..

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  Kurt Mehlhorn,et al.  Computing a Maximum Cardinality Matching in a Bipartite Graph in Time O(^1.5 sqrt m/log n) , 1991, Inf. Process. Lett..

[8]  C Berge,et al.  TWO THEOREMS IN GRAPH THEORY. , 1957, Proceedings of the National Academy of Sciences of the United States of America.

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

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

[11]  Jin-Yi Cai,et al.  The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[12]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

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

[14]  Xishun Zhao,et al.  Two tractable subclasses of minimal unsatisfiable formulas , 1999 .

[15]  N. Biggs.  MATCHING THEORY (Annals of Discrete Mathematics 29) , 1988 .

[16]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[17]  Bernard Meltzer.  Theorem-Proving for Computers: Some Results on Resolution and Renaming , 1966, Comput. J..

[18]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .