Existential second-order logic over graphs: Charting the tractability frontier

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2000, Pages 664-674

  Gottlob, Georg ^a   Kolaitis, Phokion G ^b   Schwentick, Thomas ^c  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c JOHANNES GUTENBERG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; POLYNOMIALS; THEOREM PROVING;

EXISTENTIAL SECOND ORDER LOGIC; FAGIN'S THEOREM;

GRAPH THEORY;

EID: 0034497861     PISSN: 02725428     EISSN: None     Source Type: Journal    
DOI: 10.1109/SFCS.2000.892334     Document Type: Article

References (20)

1. H. L. Bodlaender A linear-time algorithm for finding tree-decompositions of small treewidth SIAM Journal on Computing 25 6 1305 1317 1996
2. E. Börger E. Grädel Y. Gurevich The Classical Decision Problem 1997 Springer Berlin Heidelberg
3. J. R. Büchi Weak second-order arithmetic and finite automata Z. Math. Logik Grundlagen Math. 6 66 92 1960
4. B. Courcelle The Monadic Second-Order Logic of Graphs I: Recognizable Sets of Finite Graphs Information and Computation 85 12 75 1990
5. T.. Eiter G. Gottlob Y. Gurevich Existential Second Order Logic Over strings Proc. 13th Annual Symposium on Logic in Computer Science LICS'98 77 131 Proc. 13th Annual Symposium on Logic in Computer Science LICS'98 Indianapolis IN 1998-June
6. R. Fagin Complexity of Computation 43 74 1974 AMS Generalized First-Order Spectra and Polynomial-Time Recognizable Sets
7. M.R. Garey D.S. Johnson A Guide to the Theory of NP-completeness 1979 Freeman and Comp. USA, NY Computers and Intractability
8. E. Grädel The Expressive Power of Second-Order Horn Logic Proceedings STACS-91 480 466 477 Proceedings STACS-91 1991
9. E. Grädel Capturing Complexity Classes with Fragments of Second Order Logic Theoretical Computer Science 101 35 57 1992
10. N. Immerman Nondeterministic space is closed under complementation SIAM J. Comp. 17 935 939 1988
11. N. Immerman Descriptive Complexity Theory 1998 Springer
12. N.D. Jones Y.E. Lien W.T. Laaser New Problems Complete for Nondeterministic Log Space Mathematical Systems Theory 10 1 17 1976
13. R. Ladner On the Structure of Polynomial Time Reducibility J.ACM 22 155 171 1975
14. C.H. Papadimitriou Computational Complexity 1994 Addison-Wesley Pa, Reading
15. C. H. Papadimitriou M. Yannakakis Optimization, Approximation, and Complexity Classes Journal of Computer and System Sciences 43 425 440 1991
16. N. Robertson P.D. Seymour Graph Minors II. Algorithmic Aspects of Tree-Width J. Algorithms 7 309 322 1986
17. R. Szelepcsènyi The method of forced enumeration for nondeterministic automata Acta Informatica 26 279 284 1988
18. C. Thomassen On the Presence of Disjoint Subgraphs of a Specified Type. Algorithmic Aspects of TreeWidth J. of Graph Theory 12 1 101 111 1988
19. B. Trakhtenbrot The Impossibility of an Algorithm for the Decision Problem for Finite Domains (Russian) 70 569 572 1950 Doklady Academii Nauk SSR
20. Translation Series 2 23 1 5 1963 American Mathematical Society