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

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 503-516

  Fleischner, Herbert ^a   Kullmann, Oliver ^b   Szeider, Stefan ^a  

^a ERICH SCHMID INSTITUTE OF MATERIALS SCIENCE   (Austria)

^b SWANSEA UNIVERSITY   (United Kingdom)

Author keywords

Autarky; Deficiency; Matching; Minimal unsatisfiable; Polynomial time algorithm; SAT

Indexed keywords

ALGORITHMS; GRAPH THEORY; POLYNOMIALS; THEOREM PROVING;

CLAUSE-VARIABLE DIFFERENCES;

COMPUTATIONAL COMPLEXITY;

EID: 0037163958     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00337-1     Document Type: Article

References (19)

1. Aharoni R., Linial N. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A. 43:1986;196-204.
2. 1.5 √m/log n) Inform. Process. Lett. 37(4):1991;237-240.
3. Berge C. Two theorems in graph theory. Proc. Nat. Acad. Sci. USA. 43:1957;844-882.
4. Davidov G., Davydova I., Kleine Büning H. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell. 23:1998;229-245.
5. Diestel R. Graph theory, Graduate Texts in Mathematics, Vol. 173. 2nd ed. 2000;Springer, Berlin.
6. H. Fleischner, S. Szeider, Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference, Technical Report TR00-049, Electronic Colloquium on Computational Complexity (ECCC), 2000.
7. J. Franco, A. Van Gelder, A perspective on certain polynomial time solvable classes of satisfiability, Discr. Appl. Math., to appear.
8. Z. Galil, Efficient algorithms for finding maximal matching in graphs, in: CAAP '83 (L'Aquila, 1983), Vol. 159, Springer, Berlin, 1983, pp. 90-113.
9. 5/2 algorithm for maximum matchings in bipartite graphs J. Comput. 2:1973;225-231.
10. Johnson D.S. A catalog of complexity classes. van Leewen J. Handbook of Theoretical Computer Science, Vol. A, Chap. 2. 1990;67-161 Elsevier Science Publishers, North-Holland.
11. Kleine Büning H. An upper bound for minimal resolution refutations. Gottlob G., Grandjean E., Seyr K. CSL'98, LNCS, Vol. 1584. 1999;171-178 Springer, Berlin.
12. Kleine Büning H. On subclasses of minimal unsatisfiable formulas. Discr. Appl. Math. 107(1-3):2000;83-98.
13. O. Kullmann, An application of matroid theory to the SAT problem, in: Fifteenth Ann. IEEE Conf. of Computational Complexity, 2000, pp. 116-124, see also TR00-018, Electronic Colloquium on Computational Complexity (ECCC), March, 2000.
14. Kullmann O. Investigations on autark assignments. Discr. Appl. Math. 107(1-3):2000;99-137.
15. O. Kullmann, Lean clause-sets: generalizations of minimally unsatisfiable clause-sets, Discr. Appl. Math., to appear.
16. Lovász L., Plummer M.D. Matching theory, Annals of Discrete Mathematics, Vol. 29. 1986;Elsevier Science Publishers, North-Holland.
17. Meltzer B. Theorem-proving for computers: some results on resolution and renaming. Comp. J. 8:1966;341-343.
18. Papadimitriou C.H., Wolfe D. The complexity of facets resolved. J. Comput. System Sci. 37(1):1988;2-13.
19. Zhao X., Ding D. Two tractable subclasses of minimal unsatisfiable formulas. Sci. China Ser. A. 42(7):1999;720-731.