{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T07:10:03Z","timestamp":1737184203469,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_5","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T04:57:30Z","timestamp":1181365050000},"page":"70-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Games and Model Checking for Guarded Logics"],"prefix":"10.1007","author":[{"given":"Dietmar","family":"Berwanger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erich","family":"Gr\u00e4del","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1004275029985","volume":"27","author":"H. Andr\u00e9ka","year":"1998","unstructured":"H. Andr\u00e9ka, J. van Benthem, and I. N\u00e9meti, Modal languages and bounded fragments of predicate logic, Journal of Philosophical Logic, 27 (1998), 217\u2013274.","journal-title":"Journal of Philosophical Logic"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"D. Berwanger, Games and model checking for guarded logics. Diploma thesis, RWTH Aachen, 2000.","DOI":"10.1007\/3-540-45653-8_5"},{"key":"5_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-40922-X_4","volume-title":"Formal Methods in Computer Aided Design","author":"R. Bloem","year":"2000","unstructured":"R. Bloem, H. Gabow, and F. Somenzi, An algorithm for strongly connected component analysis in n log n symbolic steps, in Formal Methods in Computer Aided Design, LNCS Nr. 1954 (2000), 37\u201354."},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","first-page":"89","volume-title":"Computer Science Logic CSL 96","author":"S. Dziembowski","year":"1996","unstructured":"S. Dziembowski, Bounded-variable fixpoint queries are PSPACE-complete, Computer Science Logic CSL 96. LNCS Nr. 1258 (1996), 89\u2013105."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"A. Emerson and C. Jutla, Tree automata, mu-calculus and determinacy, in Proc. 32nd IEEE Symp. on Foundations of Computer Science, 1991, 368\u2013377.","DOI":"10.1109\/SFCS.1991.185392"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1016\/S0304-3975(00)00034-7","volume":"258","author":"A. Emerson","year":"2001","unstructured":"A. Emerson and C. Jutla and A. P. Sistla, On model checking for the \u03bc-calculus and its fragments, Theoretical Computer Science 258 (2001), 491\u2013522.","journal-title":"Theoretical Computer Science"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/3-540-44503-X_2","volume-title":"Query evaluation via tree-decompositions","author":"J. Flum","year":"2001","unstructured":"J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, in Database Theory-ICDT 2001, LNCS Nr. 1973 (2001), 22\u201338."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, C. Meyer, and M. Veanes, The two-variable guarded fragment with transitive relations, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 24\u201334.","DOI":"10.1109\/LICS.1999.782582"},{"key":"5_CR9","unstructured":"G. Gottlob, E. Gr\u00e4del, and H. Veith, Datalog LITE: A deductive query language with linear time model checking, ACM Transactions on Computational Logic, (to appear)."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"G. Gottlob, N. Leone, and F. Scarcello, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width, in Proc. 20th ACM Symp. on Principles of Database Systems, 2001, 195\u2013201.","DOI":"10.1145\/375551.375579"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.2307\/2586808","volume":"64","author":"E. Gr\u00e4del","year":"1999","unstructured":"E. Gr\u00e4del, On the restraining power of guards, Journal of Symbolic Logic, 64 (1999), 1719\u20131742.","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del, Guarded fixed point logics and the monadic theory of countable trees, to appear in Theoretical Computer Science, (2001).","DOI":"10.1016\/S0304-3975(01)00151-7"},{"key":"5_CR13","unstructured":"E. Gr\u00e4del, Why are modal logics so robustly decidable?, in Current Trends in Theoretical Computer Science. Entering the 21st Century, G. Paun, G. Rozenberg, and A. Salomaa, eds., World Scientific, 2001, 393\u2013498."},{"key":"5_CR14","first-page":"73","volume":"224","author":"E. Gr\u00e4del","year":"1999","unstructured":"E. Gr\u00e4del and M. Otto, On logics with two variables, Theoretical Computer Science, 224 (1999), 73\u2013113.","journal-title":"On logics with two variables"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"E. Gr\u00e4del and I. Walukiewicz, Guarded fixed point logic, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999, 45\u201354.","DOI":"10.1109\/LICS.1999.782585"},{"key":"5_CR16","unstructured":"B. Herwig, Zur Modelltheorie von L\u03bc. Dissertation, Universit\u00e4t Freiburg, 1989."},{"key":"5_CR17","first-page":"119","volume":"68","author":"M. Jurdzinski","year":"1998","unstructured":"M. Jurdzinski, Deciding the winner in parity games is in UP \u2229 Co-UP., Information Processing Letters, 68 (1998), 119\u2013124.","journal-title":"Deciding the winner in parity games is in UP \u2229 Co-UP."},{"key":"5_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"Proceedings of STACS 2000","author":"M. Jurdzi\u0144ski","year":"2000","unstructured":"M. Jurdzi\u0144ski, Small progress measures for solving parity games, Proceedings of STACS 2000, LNCS Nr. 1770 (2000), 290\u2013301."},{"key":"5_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1007\/3-540-45315-6_18","volume-title":"Proceedings of FOSSACS 2001","author":"V. King","year":"2001","unstructured":"V. King, O. Kupferman, and M. Vardi, On the complexity of parity word automata, in Proceedings of FOSSACS 2001, LNCS Nr. 2030 (2001), 276\u2013286."},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1145\/333979.333987","volume":"47","author":"O. Kupferman","year":"2000","unstructured":"O. Kupferman, M. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the ACM, 47 (2000), 312\u2013360.","journal-title":"Journal of the ACM"},{"key":"5_CR21","unstructured":"C. Stirling, Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997."},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"M. Vardi, On the complexity of bounded-variable queries, in Proc. 14th ACM Symp. on Principles of Database Systems, 1995, 266\u2013267.","DOI":"10.1145\/212433.212474"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T04:21:32Z","timestamp":1737087692000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"20 November 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}