{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T01:17:57Z","timestamp":1743038277640,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662445211"},{"type":"electronic","value":"9783662445228"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44522-8_22","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:12:23Z","timestamp":1407838343000},"page":"256-266","source":"Crossref","is-referenced-by-count":5,"title":["Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded Structures"],"prefix":"10.1007","author":[{"given":"Kord","family":"Eickmeyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Elberfeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frederik","family":"Harwath","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"22_CR1","doi-asserted-by":"publisher","first-page":"168","DOI":"10.2178\/jsl\/1231082307","volume":"74","author":"M.A. Benedikt","year":"2009","unstructured":"Benedikt, M.A., Segoufin, L.: Towards a characterization of order-invariant queries over tame graphs. Journal of Symbolic Logic\u00a074(1), 168\u2013186 (2009)","journal-title":"Journal of Symbolic Logic"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-33293-7_21","volume-title":"Parameterized and Exact Computation","author":"A. Bouland","year":"2012","unstructured":"Bouland, A., Dawar, A., Kopczy\u0144ski, E.: On tractable parameterizations of graph isomorphism. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol.\u00a07535, pp. 218\u2013230. Springer, Heidelberg (2012)"},{"issue":"1","key":"22_CR3","first-page":"99","volume":"25","author":"A. Chandra","year":"1982","unstructured":"Chandra, A., Harel, D.: Structure and complexity of relational queries. JCSS\u00a025(1), 99\u2013128 (1982)","journal-title":"JCSS"},{"issue":"1-2","key":"22_CR4","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. Theoretical Computer Science\u00a0160(1-2), 87\u2013143 (1996)","journal-title":"Theoretical Computer Science"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph Structure and Monadic Second-Order Logic \u2013 A Language-Theoretic Approach. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Grohe, M., Tantau, T.: Where first-order and monadic second-order logic coincide. In: Proc. LICS 2012, pp. 265\u2013274. IEEE Computer Society (2012)","DOI":"10.1109\/LICS.2012.37"},{"key":"22_CR7","unstructured":"Gajarsk\u00fd, J., Hlin\u011bn\u00fd, P.: Faster deciding MSO properties of trees of fixed height, and some consequences. In: Proc. FSTTCS 2012, pp. 112\u2013123 (2012)"},{"issue":"1:6","key":"22_CR8","first-page":"1","volume":"1","author":"M. Grohe","year":"2005","unstructured":"Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. Logical Methods in Computer Science\u00a01(1:6), 1\u201325 (2005)","journal-title":"Logical Methods in Computer Science"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer (2004)","DOI":"10.1007\/978-3-662-07003-1"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Ne\u0161et\u0159il, J., Ossona de Mendez, P.: Sparsity: Graphs, Structures, and Algorithms. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-27875-4"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-642-38536-0_10","volume-title":"Computer Science \u2013 Theory and Applications","author":"N. Schweikardt","year":"2013","unstructured":"Schweikardt, N.: A short tutorial on order-invariant first-order logic. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 112\u2013126. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44522-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T09:55:09Z","timestamp":1676886909000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-44522-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662445211","9783662445228"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44522-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}