{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T22:39:26Z","timestamp":1784241566598,"version":"3.55.0"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,24]],"date-time":"2022-03-24T00:00:00Z","timestamp":1648080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Bergen"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Public announcement logic (PAL) is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic (GAL), allows quantification over (possibly joint) announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making such announcements. It seems intuitive that this notion of coalitional ability should be closely related to the notion of distributed knowledge, the implicit knowledge of a group. Thus, we study the extension of GAL with distributed knowledge, and in particular possible interaction properties between GAL operators and distributed knowledge. The perhaps surprising result is that, in fact, there are no interaction properties, contrary to intuition. We make this claim precise by providing a sound and complete axiomatisation of GAL with distributed knowledge. We also consider several natural variants of GAL with distributed knowledge, as well as some other related logic, and compare their expressive power.<\/jats:p>","DOI":"10.1007\/s10849-022-09355-0","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T04:40:28Z","timestamp":1648183228000},"page":"141-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power"],"prefix":"10.1007","volume":"31","author":[{"given":"Thomas","family":"\u00c5gotnes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Natasha","family":"Alechina","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rustam","family":"Galimullin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,24]]},"reference":[{"issue":"7","key":"9355_CR1","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1093\/logcom\/exv085","volume":"29","author":"T \u00c5gotnes","year":"2019","unstructured":"\u00c5gotnes, T., & Alechina, N. (2019). Coalition logic with individual, distributed and common knowledge. Journal of Logic and Computation, 29(7), 1041\u20131069. https:\/\/doi.org\/10.1093\/logcom\/exv085","journal-title":"Journal of Logic and Computation"},{"issue":"1","key":"9355_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.jal.2008.12.002","volume":"8","author":"T \u00c5gotnes","year":"2010","unstructured":"\u00c5gotnes, T., Balbiani, P., van Ditmarsch, H., & Seban, P. (2010). Group announcement logic. Journal of Applied Logic, 8(1), 62\u201381. https:\/\/doi.org\/10.1016\/j.jal.2008.12.002","journal-title":"Journal of Applied Logic"},{"key":"9355_CR3","unstructured":"\u00c5gotnes, T., & van Ditmarsch, H. (2008). Coalitions and announcements. In L.\u00a0Padgham, D. C. Parkes, J. P. M\u00fcller, S.\u00a0Parsons (Eds.), Proceedings of the 7th AAMAS (pp. 673\u2013680). IFAAMAS."},{"key":"9355_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2017.07.002","volume":"252","author":"T \u00c5gotnes","year":"2017","unstructured":"\u00c5gotnes, T., & W\u00e1ng, Y. N. (2017). Resolving distributed knowledge. Artificial Intelligence, 252, 1\u201321. https:\/\/doi.org\/10.1016\/j.artint.2017.07.002","journal-title":"Artificial Intelligence"},{"key":"9355_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-021-09339-6","author":"N Alechina","year":"2021","unstructured":"Alechina, N., van Ditmarsch, H., Galimullin, R., & Wang, T. (2021). Verification and strategy synthesis for coalition announcement logic. Journal of Logic, Language and Information.https:\/\/doi.org\/10.1007\/s10849-021-09339-6","journal-title":"Journal of Logic, Language and Information."},{"key":"9355_CR6","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/585265.585270","volume":"49","author":"R Alur","year":"2002","unstructured":"Alur, R., Henzinger, T. A., & Kupferman, O. (2002). Alternating-time temporal logic. Journal of the ACM, 49, 672\u2013713. https:\/\/doi.org\/10.1145\/585265.585270","journal-title":"Journal of the ACM"},{"issue":"3","key":"9355_CR7","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1017\/S1755020308080210","volume":"1","author":"P Balbiani","year":"2008","unstructured":"Balbiani, P., Baltag, A., van Ditmarsch, H., Herzig, A., Hoshi, T., & de Lima, T. (2008). Knowable\u2019 as \u2018known after an announcement. Review of Symbolic Logic, 1(3), 305\u2013334. https:\/\/doi.org\/10.1017\/S1755020308080210","journal-title":"Review of Symbolic Logic"},{"issue":"2","key":"9355_CR8","first-page":"65","volume":"8","author":"P Balbiani","year":"2015","unstructured":"Balbiani, P., & van Ditmarsch, H. (2015). A simple proof of the completeness of APAL. Studies in Logic, 8(2), 65\u201378.","journal-title":"Studies in Logic"},{"issue":"11","key":"9355_CR9","doi-asserted-by":"publisher","first-page":"1620","DOI":"10.1016\/j.ic.2006.04.006","volume":"204","author":"J van Benthem","year":"2006","unstructured":"van Benthem, J., van Eijck, J., & Kooi, B. (2006). Logics of communication and change. Information and Computation, 204(11), 1620\u20131662. https:\/\/doi.org\/10.1016\/j.ic.2006.04.006","journal-title":"Information and Computation"},{"key":"9355_CR10","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.ic.2014.07.013","volume":"239","author":"L Bozzelli","year":"2014","unstructured":"Bozzelli, L., van Ditmarsch, H., French, T., Hales, J., & Pinchinat, S. (2014). Refinement modal logic. Information and Computation, 239, 303\u2013339. https:\/\/doi.org\/10.1016\/j.ic.2014.07.013","journal-title":"Information and Computation"},{"key":"9355_CR11","unstructured":"van Ditmarsch, H. (2020). Quantifying notes revisited. CoRR. arxiv:2004.05802"},{"key":"9355_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-020-09922-1","author":"H van Ditmarsch","year":"2020","unstructured":"van Ditmarsch, H., French, T., & Hales, J. (2020). Positive announcements. Studia Logica. https:\/\/doi.org\/10.1007\/s11225-020-09922-1","journal-title":"Studia Logica"},{"issue":"2","key":"9355_CR13","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11229-005-3384-9","volume":"151","author":"H van Ditmarsch","year":"2006","unstructured":"van Ditmarsch, H., & Kooi, B. (2006). The secret of my success. Synthese, 151(2), 201\u2013232. https:\/\/doi.org\/10.1007\/s11229-005-3384-9","journal-title":"Synthese"},{"key":"9355_CR14","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., van\u00a0der Hoek, W., & Kooi, B. (2008). Dynamic epistemic logic. In Synthese library, vol. 337. Springer.","DOI":"10.1007\/978-1-4020-5839-4"},{"key":"9355_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.artint.2016.10.003","volume":"242","author":"H van Ditmarsch","year":"2017","unstructured":"van Ditmarsch, H., van der Hoek, W., Kooi, B., & Kuijer, L. B. (2017). Arbitrary arrow update logic. Artificial Intelligence, 242, 80\u2013106. https:\/\/doi.org\/10.1016\/j.artint.2016.10.003","journal-title":"Artificial Intelligence"},{"key":"9355_CR16","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J. Y., Moses, Y., & Vardi, M. (1995). Reasoning about knowledge. The MIT Press.","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"9355_CR17","unstructured":"French, T., Galimullin, R., van Ditmarsch, H., & Alechina, N. (2019) Groups versus coalitions: On the relative expressivity of GAL and CAL. In E.\u00a0Elkind, M.\u00a0Veloso, N.\u00a0Agmon, M. E. Taylor (Eds.), Proceedings of the 18th AAMAS (pp. 953\u2013961). IFAAMAS."},{"key":"9355_CR18","unstructured":"Galimullin, R. (2019). Coalition announcements. Ph.D. Thesis, University of Nottingham, UK."},{"key":"9355_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/s10849-020-09327-2","author":"R Galimullin","year":"2021","unstructured":"Galimullin, R. (2021). Coalition and relativised group announcement logic. Journal of Logic, Language and Information.https:\/\/doi.org\/10.1007\/s10849-020-09327-2","journal-title":"Journal of Logic, Language and Information."},{"key":"9355_CR20","unstructured":"Galimullin, R., & \u00c5gotnes, T. (2021). Quantified announcements and common knowledge. In U.\u00a0Endriss, A.\u00a0Now\u00e9, F.\u00a0Dignum, A.\u00a0Lomuscio (Eds.), Proceedings of the 20th AAMAS (pp. 528\u2013536). IFAAMAS."},{"key":"9355_CR21","doi-asserted-by":"publisher","unstructured":"Galimullin, R., \u00c5gotnes, T., & Alechina, N. (2019). Group announcement logic with distributed knowledge. In P.\u00a0Blackburn, E.\u00a0Lorini, M.\u00a0Guo (Eds.), Proceedings of the 7th LORI, LNCS, vol. 11813 (pp. 98\u2013111). Springer. https:\/\/doi.org\/10.1007\/978-3-662-60292-8_8","DOI":"10.1007\/978-3-662-60292-8_8"},{"key":"9355_CR22","doi-asserted-by":"publisher","unstructured":"Galimullin, R., Alechina, N., & van Ditmarsch, H. (2018). Model checking for coalition announcement logic. In F.\u00a0Trollmann, A.\u00a0Turhan (Eds.), Proceedings of the 41st KI, LNCS, vol. 11117 (pp. 11\u201323). Springer. https:\/\/doi.org\/10.1007\/978-3-030-00111-7_2","DOI":"10.1007\/978-3-030-00111-7_2"},{"key":"9355_CR23","doi-asserted-by":"publisher","unstructured":"Goldblatt, R. (1982). Axiomatising the Logic of Computer Programming, LNCS, vol. 130. Springer. https:\/\/doi.org\/10.1007\/BFb0022481","DOI":"10.1007\/BFb0022481"},{"key":"9355_CR24","doi-asserted-by":"crossref","unstructured":"Goranko, V., & Otto, M. (2007). Model theory of modal logic. In P. Blackburn, J. van Benthem, & F. Wolter (Eds.), Handbook of Modal Logic, Studies in Logic and Practical Reasoning (Vol. 3, pp. 249\u2013329). Elsevier.","DOI":"10.1016\/S1570-2464(07)80008-5"},{"key":"9355_CR25","doi-asserted-by":"publisher","unstructured":"Hales, J. (2013). Arbitrary action model logic and action model synthesis. In Proceedings of the 28th LICS (pp. 253\u2013262). IEEE Computer Society. https:\/\/doi.org\/10.1109\/LICS.2013.31","DOI":"10.1109\/LICS.2013.31"},{"issue":"2","key":"9355_CR26","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1142\/S0129054192000139","volume":"3","author":"W van der Hoek","year":"1992","unstructured":"van der Hoek, W., & Meyer, J. C. (1992). Making some issues of implicit knowledge explicit. International Journal of Foundations of Computer Science, 3(2), 193\u2013223. https:\/\/doi.org\/10.1142\/S0129054192000139","journal-title":"International Journal of Foundations of Computer Science"},{"key":"9355_CR27","unstructured":"Holliday, W. H.,Icard III, T. F.(2010).Moorean phenomena in epistemic logic. In L. D. Beklemishev, V.\u00a0Goranko, V. B. Shehtman (Eds.), Proceedings of the 8th AiML (pp. 178\u2013199). College Publications."},{"issue":"1","key":"9355_CR28","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M Pauly","year":"2002","unstructured":"Pauly, M. (2002). A modal logic for coalitional power in games. Journal of Logic and Computation, 12(1), 149\u2013166. https:\/\/doi.org\/10.1093\/logcom\/12.1.149","journal-title":"Journal of Logic and Computation"},{"issue":"2","key":"9355_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s11229-007-9168-7","volume":"158","author":"J Plaza","year":"2007","unstructured":"Plaza, J. (2007). Logics of public communications. Synthese, 158(2), 165\u2013179. https:\/\/doi.org\/10.1007\/s11229-007-9168-7","journal-title":"Synthese"},{"issue":"2","key":"9355_CR30","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.3166\/jancl.17.255-273","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"9355_CR31","doi-asserted-by":"publisher","unstructured":"W\u00e1ng, Y. N., & \u00c5gotnes, T. (2013). Public announcement logic with distributed knowledge: expressivity, completeness and complexity. Synthese, 190(Supplement-1), 135\u2013162. https:\/\/doi.org\/10.1007\/s11229-012-0243-3","DOI":"10.1007\/s11229-012-0243-3"},{"issue":"3","key":"9355_CR32","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.jal.2015.06.004","volume":"13","author":"YN W\u00e1ng","year":"2015","unstructured":"W\u00e1ng, Y. N., & \u00c5gotnes, T. (2015). Relativized common knowledge for dynamic epistemic logic. Journal of Applied Logic, 13(3), 370\u2013393. https:\/\/doi.org\/10.1016\/j.jal.2015.06.004","journal-title":"Journal of Applied Logic"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10849-022-09355-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-022-09355-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T23:34:28Z","timestamp":1726875268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10849-022-09355-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,24]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9355"],"URL":"https:\/\/doi.org\/10.1007\/s10849-022-09355-0","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,24]]},"assertion":[{"value":"18 February 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}