{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:21Z","timestamp":1760202561154,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705741"},{"type":"electronic","value":"9783540705758"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70575-8_1","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"1-13","source":"Crossref","is-referenced-by-count":6,"title":["Graph Structure and Monadic Second-Order Logic: Language Theoretical Aspects"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Courcelle","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","first-page":"73","volume-title":"Logic and automata: History and Perspectives","author":"A. Blumensath","year":"2008","unstructured":"Blumensath, A., Colcombet, T., L\u00f6ding, C.: Logical Theories and Compatible Operations. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and automata: History and Perspectives, pp. 73\u2013106. University Press, Amsterdam (2008)"},{"key":"1_CR2","series-title":"Foundations","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1142\/9789812384720_0005","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","author":"B. Courcelle","year":"1997","unstructured":"Courcelle, B.: The Expression of Graph Properties and Graph Transformations in Monadic Second-Order Logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol.\u00a01, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"unstructured":"Courcelle, B.: Graph Structure and Monadic Second-order Logic. Cambridge University Press, Cambridge (in preparation), \n                      http:\/\/www.labri.fr\/perso\/courcell","key":"1_CR3"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R. Downey","year":"1999","unstructured":"Downey, R., Fellows, M.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"unstructured":"Flajolet, P., Sedgewick, R.: Analytic Combinatorics. Cambridge University Press, Cambridge (to appear)","key":"1_CR5"},{"key":"1_CR6","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"unstructured":"Grohe, M.: Logic, Graphs, and Algorithms. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and automata: History and Perspectives, pp. 357\u2013422. Amsterdam University Press (2008)","key":"1_CR7"},{"key":"1_CR8","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198528173.001.0001","volume-title":"Graphs and homomorphisms","author":"P. Hell","year":"2004","unstructured":"Hell, P., Ne\u0161et\u0159il, J.: Graphs and homomorphisms. Oxford University Press, Oxford (2004)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.apal.2003.11.002","volume":"126","author":"J. Makowsky","year":"2004","unstructured":"Makowsky, J.: Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic\u00a0126, 159\u2013213 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR10","series-title":"Foundations","doi-asserted-by":"publisher","DOI":"10.1142\/3303","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformations","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations. Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"1_CR11","volume-title":"Graph Theory","author":"W. Tutte","year":"1984","unstructured":"Tutte, W.: Graph Theory. Addison\u2013Wesley, Reading (1984)"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1016\/j.ic.2005.11.006","volume":"204","author":"A. Blumensath","year":"2006","unstructured":"Blumensath, A., Courcelle, B.: Recognizability, Hypergraph Operations, and Logical Types. Inf.Comput.\u00a0204, 853\u2013919 (2006)","journal-title":"Inf.Comput."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"H. Bodlaender","year":"1996","unstructured":"Bodlaender, H.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput.\u00a025, 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11917496_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"H. Bodlaender","year":"2006","unstructured":"Bodlaender, H.: Treewidth: Characterizations, Applications, and Computations. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 1\u201314. Springer, Heidelberg (2006)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1007\/s00224-004-1154-6","volume":"38","author":"A. Brandst\u00e4dt","year":"2005","unstructured":"Brandst\u00e4dt, A., Dragan, F., Le, H., Mosca, R.: New Graph Classes of Bounded Clique-Width. Theory Comput. Syst.\u00a038, 623\u2013645 (2005)","journal-title":"Theory Comput. Syst."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00224-005-1199-1","volume":"39","author":"A. Brandst\u00e4dt","year":"2006","unstructured":"Brandst\u00e4dt, A., Engelfriet, J., Le, H., Lozin, V.: Clique-Width for 4-Vertex Forbidden Subgraphs. Theory Comput. Syst.\u00a039, 561\u2013590 (2006)","journal-title":"Theory Comput. Syst."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s10107-003-0449-8","volume":"97","author":"M. Chudnovsky","year":"2003","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: Progress on Perfect Graphs. Mathematical programming, Ser. B\u00a097, 405\u2013422 (2003)","journal-title":"Mathematical programming, Ser. B"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.jctb.2006.04.003","volume":"97","author":"B. Courcelle","year":"2007","unstructured":"Courcelle, B., Oum, S.: Vertex-minors, Monadic Second-Order Logic, and a Conjecture by Seese. J. Comb. Theory, Ser. B\u00a097, 91\u2013126 (2007)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(92)90148-9","volume":"101","author":"B. Courcelle","year":"1992","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs VII: Graphs as Relational Structures. Theor. Comput. Sci.\u00a0101, 3\u201333 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(95)00083-6","volume":"160","author":"B. Courcelle","year":"1996","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs X: Linear Orderings. Theor. Comput. Sci.\u00a0160, 87\u2013143 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0304-3975(98)00306-5","volume":"224","author":"B. Courcelle","year":"1999","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XI: Hierarchical Decompositions of Connected Graphs. Theor. Comput. Sci.\u00a0224, 35\u201358 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(99)00305-9","volume":"237","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XII: Planar Graphs and Planar Maps. Theor. Comput. Sci.\u00a0237, 1\u201332 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(02)00578-9","volume":"299","author":"B. Courcelle","year":"2003","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XIV: Uniformly Sparse Graphs and Edge Set Quantifications. Theor. Comput. Sci.\u00a0299, 1\u201336 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jal.2005.08.004","volume":"4","author":"B. Courcelle","year":"2006","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XV: On a conjecture by D. Seese. J. Applied Logic\u00a04, 79\u2013114 (2006)","journal-title":"J. Applied Logic"},{"doi-asserted-by":"crossref","unstructured":"Courcelle, B.: The Monadic Second-Order Logic of Graphs XVI: Canonical graph decompositions. Logical Methods in Computer Science\u00a02 (2006)","key":"1_CR25","DOI":"10.2168\/LMCS-2(2:2)2006"},{"unstructured":"Courcelle, B.: Circle Graphs and Monadic Second-order logic. Journal of Applied Logic (in press)","key":"1_CR26"},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01204169","volume":"28","author":"B. Courcelle","year":"1995","unstructured":"Courcelle, B., Engelfriet, J.: A Logical Characterization of the Sets of Hypergraphs Defined by Hyperedge Replacement Grammars. Mathematical Systems Theory\u00a028, 515\u2013552 (1995)","journal-title":"Mathematical Systems Theory"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-Rewriting Hypergraph Grammars. J. Comput. Syst. Sci.\u00a046, 218\u2013270 (1993)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1017\/S0960129501003565","volume":"12","author":"B. Courcelle","year":"2002","unstructured":"Courcelle, B., Makowsky, J.: Fusion in Relational Structures and the Verification of Monadic Second-Order Properties. Mathematical Structures in Computer Science\u00a012, 203\u2013235 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width. Theory Comput. Syst.\u00a033, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.tcs.2005.03.018","volume":"342","author":"B. Courcelle","year":"2005","unstructured":"Courcelle, B., Weil, P.: The Recognizability of Sets of Graphs is a Robust Property. Theor. Comput. Sci.\u00a0342, 173\u2013228 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0168-0072(97)00048-1","volume":"92","author":"B. Courcelle","year":"1998","unstructured":"Courcelle, B., Walukiewicz, I.: Monadic Second-Order Logic, Graph Coverings and Unfoldings of Transition Systems. Ann. Pure Appl. Logic\u00a092, 35\u201362 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR33","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1137\/0603021","volume":"3","author":"W. Cunnigham","year":"1982","unstructured":"Cunnigham, W.: Decomposition of Directed Graphs. SIAM Algor. Discrete Meth.\u00a03, 214\u2013228 (1982)","journal-title":"SIAM Algor. Discrete Meth."},{"key":"1_CR34","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1006\/jcss.1997.1510","volume":"55","author":"J. Engelfriet","year":"1997","unstructured":"Engelfriet, J., van Oostrom, V.: Logical Description of Contex-Free Graph Languages. J. Comput. Syst. Sci.\u00a055, 489\u2013503 (1997)","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Fellows, M., Rosamond, F., Rotics, U., Szeider, S.: Clique-width Minimization is NP-hard. In: 38th Annual ACM Symposium on Theory of Computing, pp. 354\u2013362 (2006)","key":"1_CR35","DOI":"10.1145\/1132516.1132568"},{"key":"1_CR36","first-page":"157","volume":"37","author":"M. Frick","year":"2004","unstructured":"Frick, M.: Generalized Model-Checking over Locally Tree-Decomposable Classes. Theor. Comput. Sci.\u00a037, 157\u2013191 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.apal.2004.01.007","volume":"130","author":"M. Frick","year":"2004","unstructured":"Frick, M., Grohe, M.: The Complexity of First-order and Monadic second-order Logic Revisited. Ann. Pure Appl. Logic\u00a0130, 3\u201331 (2004)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR38","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv Orientierbare Graphen. Acta Math. Acad. Sci. Hungar\u00a018, 25\u201366 (1967); Translation in English by Maffray, F. Preissmann, M.: In: Ramirez Alfonsin,J.L., Reed, B.A.: (eds.), Perfect Graphs, pp. 25-66, Wiley, New York (2001)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1145\/507382.507388","volume":"3","author":"E. Gr\u00e4del","year":"2002","unstructured":"Gr\u00e4del, E., Hirsch, C., Otto, M.: Back and Forth Between Guarded and Modal Logics. ACM Trans. Comput. Log.\u00a03, 418\u2013463 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/BFb0028596","volume-title":"STACS 98","author":"D. Lapoire","year":"1998","unstructured":"Lapoire, D.: Recognizability Equals Monadic Second-Order Definability for Sets of Graphs of Bounded Tree-Width. In: Meinel, C., Morvan, M. (eds.) STACS 1998. LNCS, vol.\u00a01373, pp. 618\u2013628. Springer, Heidelberg (1998)"},{"key":"1_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-540-75520-3_16","volume-title":"Algorithms \u2013 ESA 2007","author":"P. Hlinen\u00fd","year":"2007","unstructured":"Hlinen\u00fd, P., Oum, S.: Finding Branch-Decompositions and Rank-Decompositions. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol.\u00a04698, pp. 163\u2013174. Springer, Heidelberg (2007)"},{"key":"1_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/BFb0028022","volume-title":"Computer Science Logic","author":"N. Klarlund","year":"1998","unstructured":"Klarlund, N.: Mona & Fido: The Logic-Automaton Connection in Practice. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 311\u2013326. Springer, Heidelberg (1998)"},{"key":"1_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/11874683_31","volume-title":"Computer Science Logic","author":"F. Madelaine","year":"2006","unstructured":"Madelaine, F.: Universal Structures and the Logic of Forbidden Patterns. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 471\u2013485. Springer, Heidelberg (2006)"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0304-3975(02)00449-8","volume":"303","author":"J. Makowsky","year":"2003","unstructured":"Makowsky, J., Marino, J.: Tree-width and the Monadic Quantifier Hierarchy. Theor. Comput. Sci.\u00a0303, 157\u2013170 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR45","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0168-0072(95)00013-5","volume":"78","author":"J. Makowsky","year":"1996","unstructured":"Makowsky, J., Pnueli, Y.: Arity and Alternation in Second-Order Logic. Ann. Pure Appl. Logic\u00a078, 189\u2013202 (1996); Erratum: Ann. Pure Appl. Logic 92, 215 (1998)","journal-title":"Ann. Pure Appl. Logic"},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0019-9958(67)90353-1","volume":"11","author":"J. Mezei","year":"1967","unstructured":"Mezei, J., Wright, J.: Algebraic Automata and Context-Free Sets. Information and Control\u00a011, 3\u201329 (1967)","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., de Mendez, P.O.: Linear Time Low Tree-width Partitions and Algorithmic Consequences. In: Proc. Symp. Theory of Computation, pp. 391\u2013400 (2006)","key":"1_CR47","DOI":"10.1145\/1132516.1132575"},{"key":"1_CR48","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S. Oum","year":"2005","unstructured":"Oum, S.: Rank-width and Vertex-minors. J. Comb. Theory, Ser. B\u00a095, 79\u2013100 (2005)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1016\/j.jctb.2005.10.006","volume":"96","author":"S. Oum","year":"2006","unstructured":"Oum, S., Seymour, P.: Approximating Clique-width and Branch-width. J. Comb. Theory, Ser. B\u00a096, 514\u2013528 (2006)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR50","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0095-8956(86)90030-4","volume":"41","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.: Graph Minors. V. Excluding a Planar Graph. J. Comb. Theory, Ser. B\u00a041, 92\u2013114 (1986)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0095-8956(90)90121-F","volume":"48","author":"N. Robertson","year":"1990","unstructured":"Robertson, N., Seymour, P.: Graph minors. VIII. A Kuratowski Theorem for General Surfaces. J. Comb. Theory, Ser. B\u00a048, 255\u2013288 (1990)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR52","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0095-8956(03)00042-X","volume":"89","author":"N. Robertson","year":"2003","unstructured":"Robertson, N., Seymour, P.: Graph Minors. XVI. Excluding a Non-planar Graph. J. Comb. Theory, Ser. B\u00a089, 43\u201376 (2003)","journal-title":"J. Comb. Theory, Ser. B"},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0168-0072(91)90054-P","volume":"53","author":"D. Seese","year":"1991","unstructured":"Seese, D.: The Structure of Models of Decidable Monadic Theories of Graphs. Ann. Pure Appl. Logic\u00a053, 169\u2013195 (1991)","journal-title":"Ann. Pure Appl. Logic"},{"unstructured":"Soguet, D.: G\u00e9n\u00e9ration Automatique d\u2019Algorithmes Lin\u00e9aires, Doctoral dissertation, Paris-Sud University, France (July 2008)","key":"1_CR54"},{"key":"1_CR55","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0166-218X(94)90026-4","volume":"54","author":"E. Wanke","year":"1994","unstructured":"Wanke, E.: k-NLC Graphs and Polynomial Algorithms. Discrete Applied Mathematics\u00a054, 251\u2013266 (1994)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70575-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T03:24:07Z","timestamp":1714620247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-70575-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705741","9783540705758"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70575-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}