{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:24:06Z","timestamp":1770899046464,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2013,1,8]],"date-time":"2013-01-08T00:00:00Z","timestamp":1357603200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Synthese"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11229-012-0243-3","type":"journal-article","created":{"date-parts":[[2013,1,7]],"date-time":"2013-01-07T10:28:39Z","timestamp":1357554519000},"page":"135-162","source":"Crossref","is-referenced-by-count":24,"title":["Public announcement logic with distributed knowledge: expressivity, completeness and complexity"],"prefix":"10.1007","volume":"190","author":[{"given":"Y\u00ec N.","family":"W\u00e1ng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"\u00c5gotnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,8]]},"reference":[{"key":"243_CR1","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/B:SYNT.0000024912.56773.5e","volume":"139","author":"A Baltag","year":"2004","unstructured":"Baltag, A., & Moss, L. (2004). Logics for epistemic programs. Synthese, 139, 165\u2013224.","journal-title":"Synthese"},{"key":"243_CR2","unstructured":"Baltag, A., Moss, L., & Solecki, S. (1998). The logic of public announcements, common knowledge, and private suspicions. In Procedings of TARK VII (pp. 43\u201356)."},{"key":"243_CR3","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., & Venema, Y. (2001). Modal logic. In Cambridge tracts in theoretical computer science (Vol. 53).","DOI":"10.1017\/CBO9781107050884"},{"key":"243_CR4","unstructured":"Fagin, R., Halpern, J., Moses, Y., & Vardi, M. (1995). Reasoning about Knowledge. MIT."},{"issue":"2","key":"243_CR5","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1145\/128749.150945","volume":"39","author":"R Fagin","year":"1992","unstructured":"Fagin, R., Halpern, J., & Vardi, M. (1992). What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM, 39(2), 328\u2013376.","journal-title":"Journal of the ACM"},{"key":"243_CR6","unstructured":"Fischer, M. J., & Ladner, R. E. (1977). Propositional modal logic of programs. In Proceedings of STOC \u201977 (pp. 286\u2013294). New York: ACM."},{"issue":"2","key":"243_CR7","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"MJ Fischer","year":"1979","unstructured":"Fischer, M. J., & Ladner, R. E. (1979). Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2), 194\u2013211.","journal-title":"Journal of Computer and System Sciences"},{"key":"243_CR8","unstructured":"Gerbrandy, J. (1999) Bisimulations on planet kripke. Ph.D. thesis, ILLC."},{"key":"243_CR9","unstructured":"G\u00f6ller, S., Lohrey, M., & Lutz, C. (2007). PDL with intersection and converse is 2EXP-complete. In H. Seidl (Ed.), FOSSACS 2007, LNCS (Vol. 4423, pp. 198\u2013212). Berlin: Springer."},{"issue":"3","key":"243_CR10","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0004-3702(92)90049-4","volume":"54","author":"J Halpern","year":"1992","unstructured":"Halpern, J., & Moses, Y. (1992). A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3), 319\u2013379.","journal-title":"Artificial Intelligence"},{"key":"243_CR11","unstructured":"Kooi, B., & van Benthem, J. (2004). Reduction axioms for epistemic actions. In Proceedings of AiML 2004 (pp. 197\u2013211)."},{"issue":"3","key":"243_CR12","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"RE Ladner","year":"1977","unstructured":"Ladner, R. E. (1977). The computational complexity of provability in systems of modal propositional logic. SIAM Journal on Computing, 6(3), 467\u2013480.","journal-title":"SIAM Journal on Computing"},{"key":"243_CR13","doi-asserted-by":"crossref","unstructured":"Lutz, C. (2005). PDL with intersection and converse is decidable. In L. Ong (Ed.), CSL 2005, LNCS (Vol. 3634, pp. 413\u2013427). Berlin: Springer.","DOI":"10.25368\/2022.148"},{"key":"243_CR14","unstructured":"Lutz, C. (2006). Complexity and succinctness of public announcement logic. In Proceedings of AAMAS \u201906 (pp. 137\u2013143). New York: ACM."},{"key":"243_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511569852","volume-title":"Epistemic logic for AI and computer science","author":"JJ Meyer","year":"1995","unstructured":"Meyer, J. J., & van der Hoek, W. (1995). Epistemic logic for AI and computer science (Vol. 41). Cambridge: Cambridge University Press."},{"key":"243_CR16","unstructured":"Plaza, J. (1989). Logics of public communications. In Proceedings of ISMIS \u201989 (pp. 201\u2013216)."},{"key":"243_CR17","doi-asserted-by":"crossref","unstructured":"Pratt, V. R. (1979). Models of program logics. In Proceedings of the 20th annual symposium on the foundations of computer science (FOCS\u201979) (pp. 115\u2013122).","DOI":"10.1109\/SFCS.1979.24"},{"issue":"2","key":"243_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.3166\/jancl.17.255-273","volume":"17","author":"F Roelofsen","year":"2007","unstructured":"Roelofsen, F. (2007). Distributed knowledge. Journal of Applied Non-Classical Logics, 17(2), 255\u2013273.","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"243_CR19","unstructured":"van Benthem, J. (2006). Open problems in logical dynamics. In D. M. Gabbay, S. S. Goncharov, & M. Zakharyaschev (Eds.), Mathematical problems from applied logic I: Logics for the XXIst century (pp. 137\u2013192). Berlin: Springer."},{"key":"243_CR20","unstructured":"van Benthem, J. F. A. K. (1999). Update as relativization. ILLC (manuscript)."},{"key":"243_CR21","unstructured":"van Ditmarsch, H., van der Hoek, W., & Kooi, B. (2007). Dynamic epistemic logic. In Synthese library (Vol. 337). Springer."},{"issue":"2","key":"243_CR22","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1142\/S0129054192000139","volume":"3","author":"W Hoek van der","year":"1992","unstructured":"van der Hoek, W., & Meyer, J. J. (1992). Making some issues of implicit knowledge explicit. International Journal of Foundations of Computer Science, 3(2), 193\u2013224.","journal-title":"International Journal of Foundations of Computer Science"},{"key":"243_CR23","unstructured":"van der Hoek, W., & Meyer, J. J. (1997). A complete epistemic logic for multiple agents: Combining distributed and common knowledge. In Epistemic logic and the theory of games and decisions (pp. 35\u201368). Dordrecht: Kluwer."},{"key":"243_CR24","doi-asserted-by":"crossref","unstructured":"W\u00e1ng, Y. N., & \u00c5gotnes, T. (2011). Public announcement logic with distributed knowledge. In Proceedings of LORI-III, LNCS (Vol. 6953, pp. 328\u2013341).","DOI":"10.1007\/978-3-642-24130-7_24"}],"container-title":["Synthese"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-012-0243-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11229-012-0243-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11229-012-0243-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T13:53:13Z","timestamp":1687960393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11229-012-0243-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,8]]},"references-count":24,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["243"],"URL":"https:\/\/doi.org\/10.1007\/s11229-012-0243-3","relation":{},"ISSN":["0039-7857","1573-0964"],"issn-type":[{"value":"0039-7857","type":"print"},{"value":"1573-0964","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,8]]}}}