{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T12:26:19Z","timestamp":1753359979538},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540858447"},{"type":"electronic","value":"9783540858454"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85845-4_40","type":"book-chapter","created":{"date-parts":[[2008,9,22]],"date-time":"2008-09-22T06:57:04Z","timestamp":1222066624000},"page":"324-331","source":"Crossref","is-referenced-by-count":7,"title":["Shallow Models for Non-iterative Modal Logics"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Schr\u00f6der","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"B. Chellas","year":"1980","unstructured":"Chellas, B.: Modal Logic. Cambridge Univ. Press, Cambridge (1980)"},{"key":"40_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11750734_2","volume-title":"Computational Logic in Multi-Agent Systems","author":"L. Cholvy","year":"2006","unstructured":"Cholvy, L., Garion, C., Saurel, C.: Ability in a multi-agent context: A model in the situation calculus. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol.\u00a03900, pp. 23\u201336. Springer, Heidelberg (2006)"},{"key":"40_CR3","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s001530100110","volume":"41","author":"G. D\u2019Agostino","year":"2002","unstructured":"D\u2019Agostino, G., Visser, A.: Finality regained: A coalgebraic study of Scott-sets and multisets. Arch. Math. Logic\u00a041, 267\u2013298 (2002)","journal-title":"Arch. Math. Logic"},{"key":"40_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/11814771_44","volume-title":"Automated Reasoning","author":"S. Demri","year":"2006","unstructured":"Demri, S., Lugiez, D.: Presburger modal logic is only PSPACE -complete. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol.\u00a04130, pp. 541\u2013556. Springer, Heidelberg (2006)"},{"key":"40_CR5","first-page":"1","volume":"2","author":"D. Elgesem","year":"1997","unstructured":"Elgesem, D.: The modal logic of agency. Nordic J. Philos. Logic\u00a02, 1\u201346 (1997)","journal-title":"Nordic J. Philos. Logic"},{"key":"40_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1145\/174652.174658","volume":"41","author":"R. Fagin","year":"1994","unstructured":"Fagin, R., Halpern, J.Y.: Reasoning about knowledge and probability. J. ACM\u00a041, 340\u2013367 (1994)","journal-title":"J. ACM"},{"key":"40_CR7","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1305\/ndjfl\/1093890715","volume":"13","author":"K. Fine","year":"1972","unstructured":"Fine, K.: In so many possible worlds. Notre Dame J. Formal Logic\u00a013, 516\u2013520 (1972)","journal-title":"Notre Dame J. Formal Logic"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0004-3702(95)00018-A","volume":"75","author":"J. Halpern","year":"1995","unstructured":"Halpern, J.: The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence\u00a075, 361\u2013372 (1995)","journal-title":"Artificial Intelligence"},{"key":"40_CR9","first-page":"207","volume-title":"Uncertainty in Artificial Intelligence, UAI 2002","author":"J. Halpern","year":"2002","unstructured":"Halpern, J., Pucella, R.: Reasoning about expectation. In: Uncertainty in Artificial Intelligence, UAI 2002, pp. 207\u2013215. Morgan Kaufmann, San Francisco (2002)"},{"key":"40_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J.Y. Halpern","year":"1992","unstructured":"Halpern, J.Y., Moses, Y.O.: A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence\u00a054, 319\u2013379 (1992)","journal-title":"Artificial Intelligence"},{"key":"40_CR11","series-title":"Lecture Notes in Artificial Intelligence","first-page":"1","volume-title":"Advances in Agent Communication","author":"A. Jones","year":"2004","unstructured":"Jones, A., Parent, X.: Conventional signalling acts and conversation. In: Dignum, F.P.M. (ed.) ACL 2003. LNCS (LNAI), vol.\u00a02922, pp. 1\u201317. Springer, Heidelberg (2004)"},{"key":"40_CR12","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R. Ladner","year":"1977","unstructured":"Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput.\u00a06, 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"40_CR13","first-page":"457","volume":"3","author":"D. Lewis","year":"1975","unstructured":"Lewis, D.: Intensional logics without iterative axioms. J. Philos. Logic\u00a03, 457\u2013466 (1975)","journal-title":"J. Philos. Logic"},{"key":"40_CR14","doi-asserted-by":"crossref","unstructured":"Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Logic\u00a08 (2007)","DOI":"10.1145\/1276920.1276924"},{"key":"40_CR15","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/322276.322287","volume":"28","author":"C. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.: On the complexity of integer programming. J. ACM\u00a028, 765\u2013768 (1981)","journal-title":"J. ACM"},{"key":"40_CR16","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(03)00201-9","volume":"309","author":"D. Pattinson","year":"2003","unstructured":"Pattinson, D.: Coalgebraic modal logic: Soundness, completeness and decidability of local consequence. Theoret. Comput. Sci.\u00a0309, 177\u2013193 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M. Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Log. Comput.\u00a012, 149\u2013166 (2002)","journal-title":"J. Log. Comput."},{"key":"40_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jlap.2006.11.004","volume":"73","author":"L. Schr\u00f6der","year":"2007","unstructured":"Schr\u00f6der, L.: A finite model construction for coalgebraic modal logic. J. Log. Algebr. Prog.\u00a073, 97\u2013110 (2007)","journal-title":"J. Log. Algebr. Prog."},{"key":"40_CR19","first-page":"231","volume-title":"Logic in Computer Science, LICS 2006","author":"L. Schr\u00f6der","year":"2006","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE reasoning for rank-1 modal logics. In: Logic in Computer Science, LICS 2006, pp. 231\u2013240. IEEE, Los Alamitos (2006)"},{"key":"40_CR20","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/logcom\/11.1.85","volume":"11","author":"S. Tobies","year":"2001","unstructured":"Tobies, S.: PSPACE reasoning for graded modal logics. J. Log. Comput.\u00a011, 85\u2013106 (2001)","journal-title":"J. Log. Comput."}],"container-title":["Lecture Notes in Computer Science","KI 2008: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85845-4_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:51:31Z","timestamp":1619524291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85845-4_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540858447","9783540858454"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85845-4_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}