A Practical Approach to Courcelle's Theorem

Electronic Notes in Theoretical Computer Science

Volumn 251, Issue C, 2009, Pages 65-81

  Kneis, Joachim ^a   Langer, Alexander ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Courcelle's Theorem; Exact Algorithms; Model Checking; Monadic Second Order Logic; Parameterized Algorithms; Treewidth

Indexed keywords

COURCELLE'S THEOREM; EXACT ALGORITHMS; MONADIC SECOND-ORDER LOGIC; PARAMETERIZED ALGORITHMS; TREEWIDTH;

ALGORITHMS; AUTOMATA THEORY; GRAPH THEORY; MATHEMATICAL MODELS; MODEL CHECKING; ROBOTS; SYSTEMS ENGINEERING; THEOREM PROVING; TRANSLATION (LANGUAGES); WIRELESS TELECOMMUNICATION SYSTEMS;

SET THEORY;

EID: 69249213535     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2009.08.028     Document Type: Article

References (32)

1. Arnborg S., Lagergren J., and Seese D. Easy Problems for Tree-Decomposable Graphs. J. Algorithms 12 2 (1991) 308-340
2. Biehl M., Klarlund N., and Rauhe T. Algorithms for guided tree automata. First International Workshop on Implementing Automata. WIA '96. Lecture Notes in Computer Science (1997) 6-25
3. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernetica 11 (1993) 1-21
4. Büchi J.R. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 6 (1960) 66-92
5. Courcelle B. Graph rewriting: an algebraic and logic approach. Handbook of theoretical computer science (vol. B): formal models and semantics (1990), MIT Press, Cambridge, MA, USA 193-242
6. Courcelle B. The monadic second order theory of Graphs I: Recognisable sets of finite graphs. Information and Computation 85 (1990) 12-75
7. Courcelle B., Makowsky J.A., and Rotics U. On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Applied Mathematics 108 1-2 (2001) 23-52
8. Courcelle B., and Mosbah M. Monadic second-order evaluations on tree-decomposable graphs. Theor. Comput. Sci. 109 1-2 (1993) 49-82
9. Downey R.G., and Fellows M.R. Parameterized Complexity (1999), Springer-Verlag
10. Ebbinghaus H.-D., and Flum J. Finite Model Theory (1999), Springer
11. Ehrenfeucht A. An application of games to the completeness problem for formalized theories. Fundamenta Mathematicae 49 (1961) 129-141
12. Elgot C. Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc. 98 (1961) 21-51
13. Feferman S., and Vaught R. The first order properties of algebraic systems. Fund. Math. 47 (1959) 57-103
14. Flum J., Frick M., and Grohe M. Query evaluation via tree-decompositions. J. ACM 49 6 (2002) 716-752
15. Flum J., and Grohe M. Parameterized Complexity Theory (2006), Springer-Verlag
16. Fraïssé R. Sur quelques classifications des systèmes de relations. Publications Scientifiques de l'Université d'Alger, Series A 1 (1954) 35-182
17. M. Frick. Easy Instances for Model Checking. PhD thesis, Universität Freiburg, 2001
18. Frick M., and Grohe M. The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130 1-3 (2004) 3-31
19. Grohe M. Computing crossing numbers in quadratic time. Journal of Computer and System Science 68 2 (2004) 285-302
20. Grohe M. Logic, graphs, and algorithms. In: Flum J., Grädel E., and Wilke T. (Eds). Logic and Automata: History and Perspectives (2007), Amsterdam University Press, Amsterdam 357-422
21. K. Kawarabayashi and B. Reed. Computing crossing number in linear time. In Proceedings of the 39th ACM Symposium on Theory of Computing, pages 382-390, 2007
22. Klarlund N., Møller A., and Schwartzbach M.I. MONA Implementation Secrets. Proc. of CIAA00 (2001), Springer-Verlag 182-194
23. Ladner R.E. Application of Model Theoretic Games to Discrete linear orders and finite automata. Information and Control 33 4 (1977) 281-303
24. Makowsky J.A. Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic 126 1-3 (2004) 159-213
25. Meyer A.R. Weak monadic second-order theory of successor is not elementary recursive. Proc. Symposium on Logic. Lecture Notes in Mathematics volume 453 (1975) 132-154
26. Niedermeier R. Invitation to Fixed-Parameter Algorithms (2006), Oxford University Press
27. Robertson N., and Seymour P.D. Graph minors I. Excluding a forest. Journal on Combinatorial Theory Series B 35 (1983) 39-61
28. Robertson N., and Seymour P.D. Graph minors-a survey. In: Anderson I. (Ed). Surveys in Combinatorics (1985), Cambridge University Press 153-171
29. Robertson N., and Seymour P.D. Graph minors. II. Algorithmic aspects of tree-width. J. Algorithms 7 (1986) 309-322
30. Thatcher J.W., and Wright J.B. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory 2 1 (1968) 57-81
31. Thomas W. Languages, automata, and logic (1997), Springer-Verlag New York, Inc., New York, NY, USA pages 389-455
32. M. Weyer. Modifizierte parametrische Komplexitätstheorie. PhD thesis, Universität Freiburg, 2008