{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T03:11:00Z","timestamp":1769829060994,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540230243","type":"print"},{"value":"9783540301240","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"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":[[2004]]},"DOI":"10.1007\/978-3-540-30124-0_25","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T17:27:59Z","timestamp":1267550879000},"page":"310-324","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Moving in a Crumbling Network: The Balanced Case"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Rohde","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2004,9,9]]},"reference":[{"key":"25_CR1","volume-title":"Festschrift in Honour of Prof. J\u00f6rg Siekmann","author":"J.v. Benthem","year":"2002","unstructured":"Benthem, J.v.: An essay on sabotage and obstruction. In: Hutter, D., Werner, S. (eds.) Festschrift in Honour of Prof. J\u00f6rg Siekmann, Springer, Heidelberg (2002)"},{"key":"25_CR2","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MIT Press, Cambridge (1995)"},{"key":"25_CR3","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.h., Rohde, P.h.: Solving the sabotage game is PSPACE-hard. In Proceedings of MFCS 2003. In: Rovan, B., Vojt\u00e1\u0161, P. (eds.) MFCS 2003. LNCS, vol.\u00a02747, pp. 531\u2013540. Springer, Heidelberg (2003)"},{"key":"25_CR4","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.h., Rohde, P.h.: Model checking and satisfiability for sabotage modal logic. In Proceedings of FSTTCS 2003. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 302\u2013313. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30124-0_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:00:50Z","timestamp":1739919650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30124-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230243","9783540301240"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30124-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]},"assertion":[{"value":"9 September 2004","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}