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

Journal of the ACM

Volumn 51, Issue 2, 2004, Pages 312-362

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

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PHILIPPS UNIVERSITY MARBURG   (Germany)

^d University of California Santa Cruz   (United States)

Author keywords

Existential second order logic; Finite model theory; Graph coloring; Graph constraints; NP complete problems; Prefix classes

Indexed keywords

DESCRIPTIVE COMPLEXITY; DICHOTOMY; PREFIX CLASSES; QUANTIFIER PATTERNS;

ARTIFICIAL INTELLIGENCE; FORMAL LOGIC; GRAPH THEORY; KNOWLEDGE BASED SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPUTATIONAL COMPLEXITY;

EID: 4243105083     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/972639.972646     Document Type: Article

References (24)

1. BODLAENDER, H. L. 1996. A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 6, 1305-1317.
2. BÖRGER, E., GRÄDEL, E., AND GUREVICH, Y. 1997. The Classical Decision Problem. Springer, Berlin, Germany.
3. BÜCHI, J. R. 1960. Weak second-order arithmetic and finite automata. Z. Math. Logik Grund. Math. 6, 66-92.
4. COURCELLE, B. 1990. The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Inf. Comput. 85, 12-75.
5. DOWNEY, R. G., AND FELLOWS, M. R. 1999. Parametrized Complexity. Springer-Verlag, New York.
6. EITER, TH., GOTTLOB, G., AND GUREVICH, Y. 2000. Existential second order logic over strings. J. ACM 47, 1, 77-131. (Preliminary version in LICS'98.)
7. EITER, TH., GOTTLOB, G., AND SCHWENTICK, TH. 2002. Second order logic over strings: Regular and nonregular fragments. In Proceedings of the 5th International Conference on Developments in Language Theory (Vienna, Austria, July 16-21, 2001). Lecture Notes in Computer Science, vol. 2295. Springer-Verlag, New York, pp. 21-36.
8. FAGIN, R. 1974. Generalized first-order spectra and polynomial-time recognizable sets. In Complexity of Computation, R. M. Karp, ed. AMS, providence, R.F., pp. 43-74.
9. GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, New York.
10. GRÄDEL, E. 1991. The Expressive power of second-order Horn Logic. In Proceedings STACS-91. Lecture Notes in Computer Science, vol. 480. Springer-Verlag, New York, pp. 466-477.
11. GRÄDEL, E. 1992. Capturing complexity classes with fragments of second order logic. Theoret. Comput. Sci. 101, 35-57.
12. IMMERMAN, N. 1988. Nondeterministic space is closed under complementation. SIAM J. Comput. 17, 935-939.
13. IMMERMAN, N. 1998. Descriptive Complexity Theory. Springer-Verlag, New York, 1999.
14. JONES, N. D., LIEN, Y. E., AND LAASER, W. T. 1976. New problems complete for nondeterministic log space. Math. Syst. Theory 10, 1-17.
15. LADNER, R. 1975. On the structure of polynomial time reducibility. J. ACM 22, 155-171.
16. PAPADIMITRIOU, C. H. 1994. Computational Complexity, Addison-Wesley, Reading, Pa.
17. PAPADIMITRIOU, C. H., AND YANNAKAKIS, M. 1991. Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43, 425-440.
18. ROBERTSON, N., AND SEYMOUR, P. D. 1986. Graph minors II. Algorithmic aspects of tree-width. J. Algorithms 7, 309-322.
19. ROBERTSON, N., AND SEYMOUR, P. D. 1984. Graph minors III. Planar tree-width. J. Combinat. Theory, Ser. B 36, 49-64.
20. SZEUEPCSÈNYI, R. 1988. The method of forced enumeration for nondeterministic automata. Acta Inf., 26, 279-284.
21. TȦRJAN, R. 1972. Depth-first search and linear graph algorithms. SIAM J. Comput. 1, 146-160.
22. THOMASSEN, C. 1988. On the presence of disjoint subgraphs of a specified type. Algorithmic aspects of tree-width. J. Graph Theory 12, 1, 101-111.
23. TRAHTBNBROT, B. 1963. The impossibility of an algorithm for the decision problem for finite domains (Russian). Doklady Academii Nauk SSR, 70:569-572, 1950. English translation: American Mathematical Society Translation Series 2, 23, 1-5.
24. TRAHTBNBROT, B. 1963. The impossibility of an algorithm for the decision problem for finite domains (Russian). Doklady Academii Nauk SSR, 70:569-572, 1950. English translation: American Mathematical Society Translation Series 2, 23, 1-5.