{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:07:38Z","timestamp":1775736458943,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642326202","type":"print"},{"value":"9783642326219","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32621-9_11","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:40:40Z","timestamp":1345286440000},"page":"142-153","source":"Crossref","is-referenced-by-count":25,"title":["Moving Arrows and Four Model Checking Results"],"prefix":"10.1007","author":[{"given":"Carlos","family":"Areces","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raul","family":"Fervari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Hoffmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1017\/S1755020310000389","volume":"4","author":"C. Areces","year":"2011","unstructured":"Areces, C., Figueira, D., Figueira, S., Mera, S.: The expressive power of memory logics. Review of Symbolic Logic\u00a04(2), 290\u2013318 (2011)","journal-title":"Review of Symbolic Logic"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01049415","volume":"4","author":"P. Blackburn","year":"1995","unstructured":"Blackburn, P., Seligman, J.: Hybrid languages. Journal of Logic, Language and Information\u00a04, 251\u2013272 (1995)","journal-title":"Journal of Logic, Language and Information"},{"key":"11_CR4","unstructured":"Blackburn, P., Wolter, F., van Benthem, J. (eds.): Handbook of Modal Logics. Elsevier (2006)"},{"key":"11_CR5","unstructured":"Gerbrandy, J.: Bisimulations on Planet Kripke. Ph.D. thesis, University of Amsterdam. ILLC Dissertation series DS-1999-01 (1999)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/978-3-540-24597-1_26","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"C. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Model Checking and Satisfiability for Sabotage Modal Logic. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 302\u2013313. Springer, Heidelberg (2003)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-540-45138-9_47","volume-title":"Mathematical Foundations of Computer Science 2003","author":"C. L\u00f6ding","year":"2003","unstructured":"L\u00f6ding, C., Rohde, P.: Solving the Sabotage Game Is PSPACE-Hard. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 531\u2013540. Springer, Heidelberg (2003)"},{"key":"11_CR8","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley (1994)"},{"issue":"2","key":"11_CR9","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","volume":"158","author":"J. Plaza","year":"2007","unstructured":"Plaza, J.: Logics of public communications. Synthese\u00a0158(2), 165\u2013179 (2007)","journal-title":"Synthese"},{"key":"11_CR10","unstructured":"Rohde, P.: On games and logics over dynamically changing structures. Ph.D. thesis, RWTH Aachen (2006)"},{"key":"11_CR11","unstructured":"van Benthem, J.: Logics for information update. In: TARK 2001: Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 51\u201367. Morgan Kaufmann Publishers Inc. (2001)"},{"key":"11_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-32254-2_16","volume-title":"Mechanizing Mathematical Reasoning","author":"J. Benthem van","year":"2005","unstructured":"van Benthem, J.: An Essay on Sabotage and Obstruction. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning. LNCS (LNAI), vol.\u00a02605, pp. 268\u2013276. Springer, Heidelberg (2005)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Kluwer (2007)","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Lewis, H.R., Simons, B.B., Burkhard, W.A., Landweber, L.H. (eds.) STOC, pp. 137\u2013146. ACM (1982)","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32621-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T03:20:44Z","timestamp":1557199244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32621-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326202","9783642326219"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32621-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}