{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:12:04Z","timestamp":1763467924416},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642005954"},{"type":"electronic","value":"9783642005961"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-00596-1_6","type":"book-chapter","created":{"date-parts":[[2009,3,27]],"date-time":"2009-03-27T01:13:03Z","timestamp":1238116383000},"page":"63-77","source":"Crossref","is-referenced-by-count":3,"title":["Separating Graph Logic from MSO"],"prefix":"10.1007","author":[{"given":"Timos","family":"Antonopoulos","sequence":"first","affiliation":[]},{"given":"Anuj","family":"Dawar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-87531-4_24","volume-title":"Computer Science Logic","author":"R. Brochenin","year":"2008","unstructured":"Brochenin, R., Demri, S., Lozes, \u00c9.: On the almighty wand. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 323\u2013338. Springer, Heidelberg (2008)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/3-540-45465-9_51","volume-title":"Automata, Languages and Programming","author":"L. Cardelli","year":"2002","unstructured":"Cardelli, L., Gardner, P., Ghelli, G.: A spatial logic for querying graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 597\u2013610. Springer, Heidelberg (2002)"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/0097-3165(89)90009-5","volume":"50","author":"K.J. Compton","year":"1989","unstructured":"Compton, K.J.: A logical approach to asymptotic combinatorics II: Monadic second-order properties. J. Comb. Theory, Ser. A\u00a050(1), 110\u2013131 (1989)","journal-title":"J. Comb. Theory, Ser. A"},{"key":"6_CR4","first-page":"313","volume-title":"Handbook of Graph Grammars","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, pp. 313\u2013400. World Scientific, Singapore (1997)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-30538-5_18","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"A. Dawar","year":"2004","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Adjunct elimination through games in static ambient logic(Extended abstract). In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol.\u00a03328, pp. 211\u2013223. Springer, Heidelberg (2004)"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.ic.2006.10.006","volume":"205","author":"A. Dawar","year":"2007","unstructured":"Dawar, A., Gardner, P., Ghelli, G.: Expressiveness and complexity of graph logic. Inf. Comput.\u00a0205(3), 263\u2013310 (2007)","journal-title":"Inf. Comput."},{"key":"6_CR7","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"issue":"3","key":"6_CR8","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(3), 418\u2013463 (2002)","journal-title":"ACM Trans. Comput. Log."},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11874683_32","volume-title":"Computer Science Logic","author":"J. Marcinkowski","year":"2006","unstructured":"Marcinkowski, J.: On the expressive power of graph logic. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 486\u2013500. Springer, Heidelberg (2006)"},{"key":"6_CR10","first-page":"55","volume-title":"LICS","author":"J.C. Reynolds","year":"2002","unstructured":"Reynolds, J.C.: Separation logic: A logic for shared mutable data structures. In: LICS, pp. 55\u201374. IEEE Computer Society, Los Alamitos (2002)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00596-1_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:12:47Z","timestamp":1551942767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00596-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642005954","9783642005961"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00596-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}