Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2697, Issue , 2003, Pages 548-558

  Szeider, Stefan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248887458     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45071-8_55     Document Type: Article

References (18)

1. R. Aharoni and N. Linial. Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas. J. Combin. Theory Ser. A, 43:196-204, 1986.
2. M. Alekhnovich and A. A. Razborov. Satisfiability, branch-width and Tseitin tautologies. In Proceedings of the 43rd IEEE FOCS, pages 593-603, 2002.
3. B. Courcelle, J. A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discr. Appl. Math., 108(1-2):23-52, 2001.
4. G. Davydov, I. Davydova, and H. Kleine Büning. An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF. Ann. Math. Artif. Intell., 23:229-245, 1998.
5. R. Diestel. Graph Theory. Springer Verlag, New York, 2nd edition, 2000.
6. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, 1999.
7. H. Fleischner, O. Kullmann, and S. Szeider. Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. Theoret. Comput. Sci., 289(1):503-516, 2002.
8. J. Franco and A. Van Gelder. A perspective on certain polynomial time solvable classes of satisfiability. Discr. Appl. Math., 125:177-214, 2003.
9. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2):55-86, 2002.
10. H. Kleine Büning. An upper bound for minimal resolution refutations. In Proc. CSL'98, volume 1584 of LNCS, pages 171-178. Springer Verlag, 1999.
11. H. Kleine Büning. On subclasses of minimal unsatisfiable formulas. Discr. Appl. Math., 107(1-3):83-98, 2000.
12. O. Kullmann. Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets. To appear in Discr. Appl. Math.
13. O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference on Computational Complexity, pages 116-124, 2000.
14. L. Lovász and M. D. Plummer. Matching Theory. North-Holland Publishing Co., Amsterdam, 1986.
15. n steps. Discr. Appl. Math., 10:287-295, 1985.
16. C. H. Papadimitriou and D. Wolfe. The complexity of facets resolved. J. Comput. System Sci., 37(1):2-13, 1988.
17. S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. Technical Report TR03-002, Revision 1, Electronic Colloquium on Computational Complexity (ECCC), 2003.
18. C. A. Tovey. A simplified NP-complete satisfiability problem. Discr. Appl. Math., 8(1):85-89, 1984.