{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T08:39:28Z","timestamp":1725525568029},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540926863"},{"type":"electronic","value":"9783540926870"}],"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-92687-0_12","type":"book-chapter","created":{"date-parts":[[2009,2,10]],"date-time":"2009-02-10T04:25:38Z","timestamp":1234239938000},"page":"164-179","source":"Crossref","is-referenced-by-count":2,"title":["Games on Strings with a Limited Order Relation"],"prefix":"10.1007","author":[{"given":"Elisabetta","family":"De Maria","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Vitacolonna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0304-3975(96)00015-1","volume":"174","author":"S. Arora","year":"1997","unstructured":"Arora, S., Fagin, R.: On winning strategies in Ehrenfeucht-Fra\u00efss\u00e9 games. Theoretical Computer Science\u00a0174, 97\u2013121 (1997)","journal-title":"Theoretical Computer Science"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.apal.2004.01.004","volume":"128","author":"H.J. Keisler","year":"2004","unstructured":"Keisler, H.J., Lotfallah, W.B.: Shrinking games and local formulas. Annals of Pure and Applied Logic\u00a0128, 215\u2013225 (2004)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0168-0072(95)00030-5","volume":"79","author":"T. Schwentick","year":"1996","unstructured":"Schwentick, T.: On winning Ehrenfeucht games and monadic NP. Annals of Pure and Applied Logic\u00a079, 61\u201392 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/11591191_11","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A. Montanari","year":"2005","unstructured":"Montanari, A., Policriti, A., Vitacolonna, N.: An Algorithmic Account of Winning Strategies in Ehrenfeucht Games on Labeled Successor Structures. In: Sutcliffe, G., Voronkov, A. (eds.) LPAR 2005. LNCS, vol.\u00a03835, pp. 139\u2013153. Springer, Heidelberg (2005)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/10703163_11","volume-title":"Computer Science Logic","author":"E. Pezzoli","year":"1999","unstructured":"Pezzoli, E.: Computational Complexity of Ehrenfeucht-Fra\u00efss\u00e9 Games on Finite Structures. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 159\u2013170. Springer, Heidelberg (1999)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-72734-7_21","volume-title":"Logical Foundations of Computer Science","author":"B. Khoussainov","year":"2007","unstructured":"Khoussainov, B., Liu, J.: On Complexity of Ehrenfeucht-Fra\u00efss\u00e9 Games. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 293\u2013309. Springer, Heidelberg (2007)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"De Maria, E., Montanari, A., Vitacolonna, N.: Games on strings with a limited order relation. Technical Report 11\/08, Department of Mathematics and Computer Science, University of Udine, Italy (2008)","DOI":"10.1007\/978-3-540-92687-0_12"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92687-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T19:09:27Z","timestamp":1558120167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92687-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540926863","9783540926870"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92687-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}