{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T11:50:58Z","timestamp":1775735458790,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540206804","type":"print"},{"value":"9783540245971","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24597-1_26","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T07:39:20Z","timestamp":1280389160000},"page":"302-313","source":"Crossref","is-referenced-by-count":28,"title":["Model Checking and Satisfiability for Sabotage Modal Logic"],"prefix":"10.1007","author":[{"given":"Christof","family":"L\u00f6ding","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Rohde","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","series-title":"LNAI","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. LNCS (LNAI), Springer, Heidelberg (2002)"},{"key":"26_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":"26_CR3","volume-title":"Finite Model Theory and Its Applications","author":"E. Gr\u00e4del","year":"2003","unstructured":"Gr\u00e4del, E.: Finite model theory and descriptive complexity. In: Finite Model Theory and Its Applications, Springer, Heidelberg (2003) (to appear)"},{"key":"26_CR4","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)"},{"key":"26_CR5","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":"26_CR6","volume-title":"Advances in Modal Logic \u2013 Proceedings of AiML 2002","author":"P. Schnoebelen","year":"2003","unstructured":"Schnoebelen, P.: The complexity of temporal logic model checking. In: Advances in Modal Logic \u2013 Proceedings of AiML 2002, World Scientific, Singapore (2003)"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24597-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T15:20:52Z","timestamp":1740324052000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24597-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206804","9783540245971"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24597-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}