{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:16:50Z","timestamp":1743013010101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319155784"},{"type":"electronic","value":"9783319155791"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15579-1_43","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"549-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity of CTL"],"prefix":"10.1007","author":[{"given":"Martin","family":"L\u00fcck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Schindler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"43_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal logic","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal logic. Cambridge University Press, New York (2001)"},{"key":"43_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Desing and synthesis of synchronisation skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982)"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Engelfriet, J.: Graph structure and monadic second-order logic, a language theoretic approach. Cambridge University Press (2012)","DOI":"10.1017\/CBO9780511977619"},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity, p. 530. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: Proc. 51th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.21"},{"issue":"1","key":"43_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0022-0000(85)90001-7","volume":"30","author":"EA Emerson","year":"1985","unstructured":"Emerson, E.A., Halpern, J.Y.: Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences 30(1), 1\u201324 (1985)","journal-title":"Journal of Computer and System Sciences"},{"key":"43_CR7","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer (2006)"},{"issue":"1","key":"43_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.artint.2009.10.003","volume":"174","author":"G Gottlob","year":"2010","unstructured":"Gottlob, G., Pichler, R., Wei, F.: Bounded treewidth as a key to tractability of knowledge representation and reasoning. Artificial Intelligence 174(1), 105\u2013132 (2010)","journal-title":"Artificial Intelligence"},{"key":"43_CR9","first-page":"84","volume":"16","author":"S Kripke","year":"1963","unstructured":"Kripke, S.: Semantical considerations on modal logic. Acta Philosophica Fennica 16, 84\u201394 (1963)","journal-title":"Acta Philosophica Fennica"},{"key":"43_CR10","unstructured":"L\u00fcck, M., Meier, A., Schindler, I.: Parameterized Complexity of CTL: A Generalization of Courcelle\u2019s Theorem. arXiv 1410.4044 (2014)"},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-28332-1_33","volume-title":"Language and Automata Theory and Applications","author":"A Meier","year":"2012","unstructured":"Meier, A., Schmidt, J., Thomas, M., Vollmer, H.: On the parameterized complexity of default logic and autoepistemic logic. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 389\u2013400. Springer, Heidelberg (2012)"},{"key":"43_CR12","unstructured":"Meier, A.: On the Complexity of Modal Logic Variants and their Fragments. Ph.D. thesis, Gottfried Wilhelm Leibniz Universit\u00e4t Hannover (2011)"},{"key":"43_CR13","unstructured":"Pippenger, N.: Theories of Computability. Cambridge University Press (1997)"},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. 18th Symposium on Foundations of Computer Science, pp. 46\u201357. IEEE Computer Society Press (1977)","DOI":"10.1109\/SFCS.1977.32"},{"issue":"3","key":"43_CR15","doi-asserted-by":"publisher","first-page":"18:1","DOI":"10.1145\/2499937.2499939","volume":"14","author":"M Praveen","year":"2013","unstructured":"Praveen, M.: Does treewidth help in modal satisfiability? ACM Transactions on Computational Logic 14(3), 18:1\u201318:32 (2013)","journal-title":"ACM Transactions on Computational Logic"},{"key":"43_CR16","volume-title":"Time and Modality","author":"AN Prior","year":"1957","unstructured":"Prior, A.N.: Time and Modality. Clarendon Press, Oxford (1957)"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:06:34Z","timestamp":1674903994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_43"}},"subtitle":["A Generalization of Courcelle\u2019s Theorem"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}