{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:49Z","timestamp":1759638709057},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662228"},{"type":"electronic","value":"9783540486602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48660-7_3","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T15:53:07Z","timestamp":1194623587000},"page":"31-51","source":"Crossref","is-referenced-by-count":25,"title":["Decision Procedures for Guarded Logics"],"prefix":"10.1007","author":[{"given":"Erich","family":"Gr\u00e4del","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,5,17]]},"reference":[{"key":"3_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), pp. 217\u2013274.","journal-title":"Journal of Philosophical Logic"},{"unstructured":"J. VAN Benthem, Dynamic bits and pieces, ILLC research report, University of Amsterdam, 1997.","key":"3_CR2"},{"doi-asserted-by":"crossref","unstructured":"A. Emerson and C. Jutla, The complexity of tree automata and logics of programs, in Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 328\u2013337.","key":"3_CR3","DOI":"10.1109\/SFCS.1988.21949"},{"unstructured":"J. Flum, On the (infinite) model theory of fixed-point logics, in Models, algebras, and proofs, X. Caicedo and C. Montenegro, eds., no. 2003 in Lecture Notes in Pure and Applied Mathematics Series, Marcel Dekker, 1999, pp. 67\u201375.","key":"3_CR4"},{"unstructured":"E. Gr\u00e4del, On the restraining power of guards, Journal of Symbolic Logic. To appear.","key":"3_CR5"},{"unstructured":"E. Gr\u00e4del and I. Walukiewicz, Guarded fixed point logic, in Proc. 14th IEEE Symp. on Logic in Computer Science, 1999.","key":"3_CR6"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D. Kozen","year":"1983","unstructured":"D. Kozen, Results on the propositional \u03bc-calculus, Theoretical Computer Science, 27(1983), pp. 333\u2013354.","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. Rabin","year":"1969","unstructured":"M. Rabin, Decidability of second-order theories and automata on infinite trees, Transactions of the AMS, 141(1969), pp. 1\u201335.","journal-title":"Transactions of the AMS"},{"doi-asserted-by":"crossref","unstructured":"B. Reed, Tree width and tangles: A new connectivity measure and some applications, in Surveys in Combinatorics, R. Bailey, ed., Cambridge University Press, 1997, pp. 87\u2013162.","key":"3_CR9","DOI":"10.1017\/CBO9780511662119.006"},{"unstructured":"C. Stirling, Bisimulation, model checking and other games. Notes for the Mathfit instructional meeting on games and computation. Edinburgh, 1997.","key":"3_CR10"},{"doi-asserted-by":"crossref","unstructured":"M. Vardi, Why is modal logic so robustly decidable?, in Descriptive Complexity and Finite Models, N. Immerman and P. Kolaitis, eds., vol. 31 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1997, pp. 149\u2013184.","key":"3_CR11","DOI":"10.1090\/dimacs\/031\/05"},{"key":"3_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/BFb0055090","volume-title":"Automata, Languages and Programming ICALP 98","author":"M. Vardi","year":"1998","unstructured":"\u2014, Reasoning about the past with two-way automata, in Automata, Languages and Programming ICALP 98, vol. 1443 of Springer Lecture Notes in Computer Science, 1998, pp. 628\u2013641."},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00009-7","volume":"200","author":"W. Zielonka","year":"1998","unstructured":"W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, 200(1998), pp. 135\u2013183.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2014 CADE-16"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48660-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T04:56:39Z","timestamp":1556945799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48660-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662228","9783540486602"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-48660-7_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}