On fixed-parameter tractable parameterizations of SAT

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

Volumn 2919, Issue , 2004, Pages 188-202

  Szeider, Stefan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; GRAPH THEORY; TREES (MATHEMATICS);

CLIQUE-WIDTH; MATCHING THEORY; PARAMETERIZED COMPLEXITY; PROPOSITIONAL SATISFIABILITY PROBLEMS; STRUCTURAL GRAPH; TREE-WIDTH;

PARAMETERIZATION;

EID: 35048878714     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_15     Document Type: Article

References (31)

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 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'02), pages 593-603, 2002.
3. S. Arnborg, D. G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree. SIAM J. Algebraic Discrete Methods, 8(2):277-284, 1987.
4. F. Bacchus, S. Dalmao, and T. Pitassi. Algorithms and complexity results for #SAT and Bayesian Inference. In 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03). To appear.
5. H. L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305-1317, 1996.
6. H. L. Bodlaender. A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1-2):1-45, 1998.
7. M. Cesati. Compendium of parameterized problems, http://bravo.ce. uniroma2.it/home/cesati/research/, 2001.
8. S. A. Cook. An exponential example for analytic tableaux. Manuscript, 1972.
9. 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.
10. B. Courcelle and S. Olariu. Upper bounds to the clique width of graphs. Discr. Appl. Math., 101(1-3):77-114, 2000.
11. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Comm. ACM, 5:394-397, 1962.
12. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer Verlag, 1999.
13. H. Fleischner, S. Földes, and S. Szeider. Remarks on the concept of robust algorithm. Technical Report RRR 26-2001, Rutgers Center for Operations Research (RUTCOR), Apr. 2001.
14. 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.
15. J. Franco, J. Goldsmith, J. Schlipf, E. Speckenmeyer, and R. P. Swaminathan. An algorithm for the class of pure implicational formulas. Discr. Appl. Math., 96/97:89-106, 1999.
16. M. C. Golumbic and U. Rotics. On the clique-width of some perfect graph classes. Internat. J. Found. Comput. Sci., 11(3):423-443, 2000. Selected papers from the Workshop on Graph-Theoretical Aspects of Computer Science (WG'99), Part 1 (Ascona).
17. G. Gottlob and R. Pichler. Hypergraphs in model checking: Acyclicity and hypertree-width versus clique-width. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, 28th International Colloquium on Automata, Languages and Programming (ICALP'01), volume 2076 of Lecture Notes in Computer Science, pages 708-719, 2001.
18. G. Gottlob, F. Scarcello, and M. Sideri. Fixed-parameter complexity in AI and nonmonotonic reasoning. Artificial Intelligence, 138(1-2):55-86, 2002.
19. P. Heusch. The complexity of the falsifiability problem for pure implicational formulas. Discr. Appl. Math., 96/97:127-138, 1999.
20. P. Heusch, S. Porschen, and E. Speckenmeyer. Improving a fixed parameter tractability time bound for the shadow problem. Technical Report 2001-425, Universität zu Köln, 2001.
21. O. Kullmann. Investigating a general hierarchy of polynomially decidable classes of CNF's based on short tree-like resolution proofs. Technical Report TR99-041, Electronic Colloquium on Computational Complexity (ECCC), 1999.
22. O. Kullmann. An application of matroid theory to the SAT problem. In Fifteenth Annual IEEE Conference on Computational Complexity, pages 116-124, 2000.
23. D. Pretolani. Hierarchies of polynomially solvable satisfiability problems. Ann. Math. Artif. Intell., 17(3-4):339-357, 1996.
24. N. Robertson and P. D. Seymour. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms, 7(3):309-322, 1986.
25. N. Robertson and P. D. Seymour. Graph minors. X. Obstructions to tree-decomposition. J. Combin. Theory Ser. B, 52(2):153-190, 1991.
26. N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65-110, 1995.
27. J. P. Spinrad. Representations of graphs. Book manuscript, Vanderbilt University, 1997.
28. S. Szeider. Generalizations of matched CNF formulas. Ann. Math. Artif. Intell. Special issue with selected papers from the 5th Int. Symp. on the Theory and Applications of Satisfiability Testing (SAT'02), to appear.
29. S. Szeider. Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable. In T. Warnow and B. Zhu, editors, The 9th International Computing and Combinatorics Conference. (COCOON'03), volume 2697 of Lecture Notes in Computer Science, pages 548-558. Springer Verlag, 2003.
30. A. Urquhart. The complexity of propositional proofs. Bull. of Symbolic Logic, 1(4):425-467, Dec. 1995.
31. M. Yannakakis. Algorithms for acyclic database schemes. In C. Zaniolo and C. Delobel, editors, Very Large Data Bases, 7th International Conference, Sep. 9-11, 1981, Cannes, France, pages 81-94. IEEE Computer Society, 1981.