{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:21:07Z","timestamp":1743085267329,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480564"},{"type":"electronic","value":"9783662480571"}],"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-662-48057-1_22","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T01:29:54Z","timestamp":1439170194000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Modal Inclusion Logic: Being Lax is Simpler than Being Strict"],"prefix":"10.1007","author":[{"given":"Lauri","family":"Hella","sequence":"first","affiliation":[]},{"given":"Antti","family":"Kuusisto","sequence":"additional","affiliation":[]},{"given":"Arne","family":"Meier","sequence":"additional","affiliation":[]},{"given":"Heribert","family":"Vollmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"22_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, Cambridge (2001)"},{"issue":"1","key":"22_CR2","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.apal.2011.08.005","volume":"163","author":"P Galliani","year":"2012","unstructured":"Galliani, P.: Inclusion and exclusion dependencies in team semantics - on some logics of imperfect information. Ann. Pure Appl. Logic 163(1), 68\u201384 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"22_CR3","unstructured":"Galliani, P., Hannula, M., Kontinen, J.: Hierarchies in independence logic. In: Ronchi Della Rocca, S. (ed.) Proceedings of Computer Science Logic 2013. Leibniz International Proceedings in Informatics (LIPIcs), vol. 23, pp. 263\u2013280 (2013)"},{"key":"22_CR4","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195085914.001.0001","volume-title":"Limits to Parallel Computation: P-Completeness Theory","author":"R Greenlaw","year":"1995","unstructured":"Greenlaw, R., Hoover, H.J., Ruzzo, W.L.: Limits to Parallel Computation: P-Completeness Theory. Oxford University Press, Oxford (1995)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Hella, L., Kuusisto, A., Meier, A., Vollmer, H.: Modal inclusion logic: Being lax is simpler than being strict. arXiv, 1504.06409 (2015)","DOI":"10.1007\/978-3-662-48057-1_22"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1305\/ndjfl\/1040046086","volume":"37","author":"E Hemaspaandra","year":"1996","unstructured":"Hemaspaandra, E.: The price of universality. Notre Dame J. Formal Logic 37(2), 174\u2013203 (1996)","journal-title":"Notre Dame J. Formal Logic"},{"key":"22_CR7","first-page":"353","volume-title":"Proceedings of Advances in Modal Logic","author":"J Kontinen","year":"2014","unstructured":"Kontinen, J., M\u00fcller, J.-S., Schnoor, H., Vollmer, H.: Modal independence logic. In: Gor\u00e9, R., Kooi, B.P., Kurucz, A. (eds.) Proceedings of Advances in Modal Logic, vol. 10, pp. 353\u2013372. College Publications, London (2014)"},{"issue":"3","key":"22_CR8","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. 6(3), 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"22_CR9","volume-title":"Computational Complexity","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/S0898-1221(00)00333-3","volume":"41","author":"G Peterson","year":"2001","unstructured":"Peterson, G., Azhar, S., Reif, J.H.: Lower bounds for multiplayer noncooperative games of incomplete information. Comput. Math. Appl. 41, 957\u2013992 (2001)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10849-005-5791-1","volume":"14","author":"I Pratt-Hartmann","year":"2005","unstructured":"Pratt-Hartmann, I.: Complexity of the two-variable fragment with counting quantifiers. JoLLI 14(3), 369\u2013395 (2005)","journal-title":"JoLLI"},{"issue":"6","key":"22_CR12","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.1093\/logcom\/exn102","volume":"19","author":"M Sevenster","year":"2009","unstructured":"Sevenster, M.: Model-theoretic and computational properties of modal dependence logic. J. Logic Comput. 19(6), 1157\u20131173 (2009)","journal-title":"J. Logic Comput."},{"key":"22_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511611193","volume-title":"Dependence Logic","author":"J V\u00e4\u00e4n\u00e4nen","year":"2007","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Dependence Logic. Cambridge University Press, Cambridge (2007)"},{"key":"22_CR14","first-page":"237","volume-title":"New Perspectives on Games and Interaction","author":"J V\u00e4\u00e4n\u00e4nen","year":"2008","unstructured":"V\u00e4\u00e4n\u00e4nen, J.: Modal dependence logic. In: Apt, K., van Rooij, R. (eds.) New Perspectives on Games and Interaction, pp. 237\u2013254. Amsterdam University Press, Amsterdam (2008)"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/978-3-319-06025-5_7","volume-title":"Johan van Benthem on Logic and Information Dynamics","author":"J van Eijck","year":"2014","unstructured":"van Eijck, J.: Dynamic epistemic logics. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logic and Information Dynamics, pp. 175\u2013202. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48057-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:19:50Z","timestamp":1674908390000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48057-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480564","9783662480571"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48057-1_22","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":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}