{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:24:59Z","timestamp":1725686699945},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642308697"},{"type":"electronic","value":"9783642308703"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30870-3_33","type":"book-chapter","created":{"date-parts":[[2012,5,27]],"date-time":"2012-05-27T22:56:12Z","timestamp":1338159372000},"page":"323-333","source":"Crossref","is-referenced-by-count":1,"title":["On the Relative Succinctness of Two Extensions by Definitions of Multimodal Logic"],"prefix":"10.1007","author":[{"given":"Wiebe","family":"van der Hoek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petar","family":"Iliev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barteld","family":"Kooi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"33_CR1","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1145\/772062.772064","volume":"4","author":"M. Adler","year":"2003","unstructured":"Adler, M., Immerman, N.: An n! lower bound on formula size. ACM Transactions on Computational Logic\u00a04(3), 296\u2013314 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal logic. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"33_CR3","unstructured":"French, T., van der Hoek, W., Iliev, P., Kooi, B.: Succinctness of epistemic languages. In: Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI), pp. 881\u2013886 (2011)"},{"key":"33_CR4","unstructured":"Gogic, G., Papadimitriou, C., Selman, B., Kautz, H.: The comparative linguistics of knowledge representation. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI), pp. 862\u2013869 (1995)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS), pp. 438\u2013447 (2004)","DOI":"10.1109\/LICS.2004.1319638"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Lutz, C.: Complexity and succinctness of public announcement logic. In: Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 137\u2013143 (2006)","DOI":"10.1145\/1160633.1160657"}],"container-title":["Lecture Notes in Computer Science","How the World Computes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30870-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T16:57:33Z","timestamp":1556816253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30870-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642308697","9783642308703"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30870-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}