Second-order logic over strings: Regular and non-regular fragments

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

Volumn 2295 LNCS, Issue , 2002, Pages 37-56

  Eiter, Thomas ^a   Gottlob, Georg ^a   Schwentick, Thomas ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING; COMPUTATIONAL LINGUISTICS; CONTEXT FREE LANGUAGES;

COMPLEXITY RESULTS; EXISTENTIAL SECOND-ORDER LOGIC; FIRST ORDER; MODEL CHECKING PROBLEM; SECOND ORDERS; SECOND-ORDER LOGIC;

COMPUTER CIRCUITS; MODEL CHECKING;

EID: 84876950817     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_4     Document Type: Conference Paper

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, andY. Gurevich. The Classical Decision Problem. Springer, 1997.
3. J. R. Büchi. On a decision method in restriced second-order arithmetic. In E. Nagel et al., editor, Proc. International Congress on Logic, Methodology and Philosophy of Science, pp. 1-11, Stanford, CA, 1960. Stanford University Press.
4. J. R. Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6:66-92, 1960.
5. B. Courcelle. The monadic second-order logic of graphs I: recognizable sets of finite graphs. Information and Computation, 85:12-75, 1990.
6. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
7. T. Eiter, G. Gottlob, and Y. Gurevich. Normal forms for second-order logic over finite structures, and classification of NP optimization problems. Annals of Pure and Applied Logic, 78:111-125, 1996.
8. T. Eiter, G. Gottlob, and Y. Gurevich. Existential second-order logic over strings. Journal of the ACM, 47(1):77-131, 2000.
9. R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In R. M. Karp, editor, Complexity of Computation, pp. 43-74. AMS, 1974.
10. G. Gottlob, P.Kolaitis, andT. Schwentick. Existential second-order logic over graphs: charting the tractability frontier. In Proc. 41st Annual Symposium on Foundations of Computer Science (FOCS 2000) , pp. 664-674. IEEE Computer Society Press, 2000.
11. E. Grädel and E. Rosen. Two-variable descriptions of regularity. In Proc. 14th Annual Symposium on Logic in Computer Science (LICS-99) , pp. 14-23. IEEE CS Press, 1999.
12. N. Immerman. Descriptive Complexity. Springer, 1997.
13. P. Kolaitis and C. Papadimitriou. Some computational aspects of circumscription. Journal of the ACM, 37(1):1-15, 1990.
14. D. Leivant. Descriptive characterizations of computational complexity. Journal of Computer and System Sciences, 39:51-83, 1989.
15. J.-E. Pin. Logic on words. Bulletin of the EATCS, 54:145-165, 1994.
16. L. J. Stockmeyer. The polynomial-time hierarchy. Theoretical Comp. Sc., 3:1-22, 1977.
17. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity. Birkhäuser, 1994.
18. W. Thomas. Automata on infinite objects. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, chapter 4. Elsevier Science Pub., 1990.
19. C. Thomassen. On the presence of disjoint subgraphs of a specified type. Journal of Graph Theory, 12:1, 101-111, 1988.
20. B. Trakhtenbrot. Finite automata and the logic of monadic predicates. Dokl. Akad. Nauk SSSR, 140:326-329, 1961.