{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:49Z","timestamp":1759638889304},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540305538"},{"type":"electronic","value":"9783540316503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11591191_11","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T04:44:25Z","timestamp":1132634665000},"page":"139-153","source":"Crossref","is-referenced-by-count":4,"title":["An Algorithmic Account of Ehrenfeucht Games on Labeled Successor Structures"],"prefix":"10.1007","author":[{"given":"Angelo","family":"Montanari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Policriti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Vitacolonna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_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":"11_CR2","doi-asserted-by":"crossref","unstructured":"Berlekamp, E.R., Conway, J.H., Guy, R.K.: Winning Ways for Your Mathematical Plays, 2nd edn., January. A\u00a0K\u00a0Peters\u00a0Ltd, Wellesley (2003)","DOI":"10.1201\/9780429487309"},{"key":"11_CR3","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Springer, Heidelberg (1995)"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.4064\/fm-49-2-129-141","volume":"49","author":"A. Ehrenfeucht","year":"1961","unstructured":"Ehrenfeucht, A.: An application of games to the completeness problem for formalized theory. Fundamenta Mathematicae\u00a049, 129\u2013141 (1961)","journal-title":"Fundamenta Mathematicae"},{"issue":"1","key":"11_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1995.1100","volume":"120","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Stockmeyer, L., Vardi, M.Y.: On monadic\u00a0NP vs. monadic co-NP. Inform. and Comput.\u00a0120(1), 78\u201392 (1995)","journal-title":"Inform. and Comput."},{"key":"11_CR6","first-page":"35","volume":"1","author":"R. Fra\u00efss\u00e9","year":"1954","unstructured":"Fra\u00efss\u00e9, R.: Sur quelques classifications des syst\u00e8mes de relations. Publications Scientifiques\u00a01, 35\u2013182 (1954)","journal-title":"Publications Scientifiques"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0049-237X(08)71879-2","volume-title":"Proceedings of the Herbrand Symposium, Logic Colloquium 1981","author":"H. Gaifman","year":"1982","unstructured":"Gaifman, H.: On local and nonlocal properties. In: Stern, J. (ed.) Proceedings of the Herbrand Symposium, Logic Colloquium 1981, pp. 105\u2013135. North Holland Pub. Co., Amsterdam (1982)"},{"key":"11_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"11_CR9","first-page":"132","volume-title":"The Theory of Models","author":"W. Hanf","year":"1965","unstructured":"Hanf, W.: Model-Theoretic Methods in the Study of Elementary Logic. In: Addison, J.W., Henkin, L., Tarski, A. (eds.) The Theory of Models, pp. 132\u2013145. North-Holland, Amsterdam (1965)"},{"key":"11_CR10","first-page":"1","volume":"6","author":"J. Hintikka","year":"1953","unstructured":"Hintikka, J.: Distributive normal forms in the calculus of predicates. Acta Philosofica Fennica\u00a06, 1\u201371 (1953)","journal-title":"Acta Philosofica Fennica"},{"key":"11_CR11","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"},{"issue":"1","key":"11_CR12","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1101\/gr.757503","volume":"13","author":"P. Pevzner","year":"2003","unstructured":"Pevzner, P., Tesler, G.: Genome Rearrangements in Mammalian Evolution: Lessons From Human and Mouse Genomes. Genome Res.\u00a013(1), 37\u201345 (2003)","journal-title":"Genome Res."},{"key":"11_CR13","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":"11_CR14","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\u00a0NP. Annals of Pure and Applied Logic\u00a079, 61\u201392 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"11_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/0022-0000(82)90016-2","volume":"25","author":"W. Thomas","year":"1982","unstructured":"Thomas, W.: Classifying regular events in symbolic logic. Journal of Computer and System Sciences\u00a025(3), 360\u2013376 (1982)","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/3-540-56610-4_89","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"W. Thomas","year":"1993","unstructured":"Thomas, W.: On the Ehrenfeucht-Fra\u00efss\u00e9 Game in Theoretical Computer Science. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 559\u2013568. Springer, Heidelberg (1993)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11591191_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:26Z","timestamp":1605625346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11591191_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540305538","9783540316503"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11591191_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}