{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T11:20:44Z","timestamp":1788002444837,"version":"build-2784847793"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T00:00:00Z","timestamp":1665360000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of China","doi-asserted-by":"publisher","award":["20YJC7204002"],"award-info":[{"award-number":["20YJC7204002"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s10472-022-09815-0","type":"journal-article","created":{"date-parts":[[2022,10,10]],"date-time":"2022-10-10T11:58:41Z","timestamp":1665403121000},"page":"375-407","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["The logic of secrets and the interpolation rule"],"prefix":"10.1007","volume":"91","author":[{"given":"Zuojun","family":"Xiong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thomas","family":"\u00c5gotnes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,10]]},"reference":[{"key":"9815_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M.: Logic in access control. In: 18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., pp 228\u2013233. IEEE (2003)","DOI":"10.1109\/LICS.2003.1210062"},{"issue":"4","key":"9815_CR2","doi-asserted-by":"publisher","first-page":"706","DOI":"10.1145\/155183.155225","volume":"15","author":"M Abadi","year":"1993","unstructured":"Abadi, M., Burrows, M., Lampson, B., Plotkin, G.: A calculus for access control in distributed systems. ACM Trans. Program. Lang. Syst. (TOPLAS) 15(4), 706\u2013734 (1993)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"issue":"2","key":"9815_CR3","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2010.10.019","volume":"111","author":"L Aceto","year":"2010","unstructured":"Aceto, L., Ingolfsdottir, A., Sack, J.: Resource bisimilarity and graded bisimilarity coincide. Inf. Process. Lett. 111(2), 68\u201376 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"8","key":"9815_CR4","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1093\/logcom\/exaa068","volume":"31","author":"T \u00c5gotnes","year":"2021","unstructured":"\u00c5gotnes, T., W\u00e1ng, Y.N.: Group belief. J. Logic Comput. 31 (8), 1959\u20131978 (2021a)","journal-title":"J. Logic Comput."},{"key":"9815_CR5","doi-asserted-by":"crossref","unstructured":"\u00c5gotnes, T., W\u00e1ng, Y.N.: Somebody knows. In: Bienvenu, M, Lakemeyer, G, Erdem, E (eds.) Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, pp 2\u201311 (2021b)","DOI":"10.24963\/kr.2021\/1"},{"key":"9815_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1613\/jair.1.11204","volume":"62","author":"KR Apt","year":"2018","unstructured":"Apt, K.R., Wojtczak, D.: Verification of distributed epistemic gossip protocols. J. Artif. Intell. Res. 62, 101\u2013132 (2018)","journal-title":"J. Artif. Intell. Res."},{"key":"9815_CR7","doi-asserted-by":"crossref","unstructured":"Apt, K.R., Grossi, D., van der Hoek, W.: Epistemic protocols for distributed gossiping. arXiv:160607516 (2016)","DOI":"10.4204\/EPTCS.215.5"},{"key":"9815_CR8","unstructured":"Attamah, M., Van Ditmarsch, H., Grossi, D., van der Hoek, W.: Knowledge and gossip. In: ECAI, pp 21\u201326 (2014)"},{"key":"9815_CR9","doi-asserted-by":"crossref","unstructured":"Attamah, M., van Ditmarsch, H., Grossi, D., van der Hoek, W.: The pleasure of gossip. In: Ba\u015fkent, C., Moss, L.S., Ramanujam, R. (eds.) Rohit Parikh on Logic, Language and Society, pp 145\u2013163. Springer (2017)","DOI":"10.1007\/978-3-319-47843-2_9"},{"key":"9815_CR10","volume-title":"Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53","author":"P Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic, Cambridge Tracts in Theoretical Computer Science, vol. 53. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"9815_CR11","doi-asserted-by":"publisher","first-page":"269","DOI":"10.2307\/2963594","volume":"22","author":"W Craig","year":"1957","unstructured":"Craig, W.: Three uses of the herbrand-gentzen theorem in relating model theory and proof theory. J. Symbol. Log. 22(3), 269\u2013285 (1957)","journal-title":"J. Symbol. Log."},{"issue":"5","key":"9815_CR12","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s11229-013-0275-3","volume":"191","author":"H van Ditmarsch","year":"2014","unstructured":"van Ditmarsch, H.: Dynamics of lying. Synthese 191(5), 745\u2013777 (2014)","journal-title":"Synthese"},{"key":"9815_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/5803.001.0001","volume-title":"Reasoning about Knowledge","author":"R Fagin","year":"1995","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge, MA (1995)"},{"issue":"1","key":"9815_CR14","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S1755020314000343","volume":"8","author":"J Fan","year":"2015","unstructured":"Fan, J., Wang, Y., Van Ditmarsch, H.: Contingency and knowing whether. Rev. Symbol. Log. 8(1), 75\u2013107 (2015)","journal-title":"Rev. Symbol. Log."},{"key":"9815_CR15","doi-asserted-by":"crossref","unstructured":"Fong, P.W.: Relationship-based access control: protection model and policy language. In: Proceedings of the First ACM Conference on Data and Application Security and Privacy, pp 191\u2013202 (2011)","DOI":"10.1145\/1943513.1943539"},{"key":"9815_CR16","doi-asserted-by":"crossref","unstructured":"Garg, D., Abadi, M.: A modal deconstruction of access control logics. In: International Conference on Foundations of Software Science and Computational Structures, pp 216\u2013230. Springer (2008)","DOI":"10.1007\/978-3-540-78499-9_16"},{"issue":"1","key":"9815_CR17","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1006\/jeth.1996.0084","volume":"70","author":"S Hart","year":"1996","unstructured":"Hart, S., Heifetz, A, Samet, D.: \u201cknowing whether\u201d, \u201cknowing that,\u201d and the cardinality of state spaces. J. Econ. Theory 70(1), 249\u2013256 (1996)","journal-title":"J. Econ. Theory"},{"issue":"4","key":"9815_CR18","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/BF00257488","volume":"3","author":"D Lewis","year":"1974","unstructured":"Lewis, D.: Intensional logics without iterative axioms. J. Philos. Log. 3(4), 457\u2013466 (1974)","journal-title":"J. Philos. Log."},{"key":"9815_CR19","doi-asserted-by":"crossref","unstructured":"Pacuit, E: Neighborhood semantics for modal logic. Springer (2017)","DOI":"10.1007\/978-3-319-67149-9"},{"issue":"1","key":"9815_CR20","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. 12(1), 149\u2013166 (2002)","journal-title":"J. Log. Comput."},{"issue":"2","key":"9815_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF02379122","volume":"9","author":"PK Schotch","year":"1980","unstructured":"Schotch, P.K., Jennings, R.E.: Modal logic and the theory of modal aggregation. Philosophia 9(2), 265\u2013278 (1980)","journal-title":"Philosophia"},{"issue":"4","key":"9815_CR22","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1023\/A:1004201429142","volume":"26","author":"TJ Surendonk","year":"1997","unstructured":"Surendonk, T.J.: Canonicity for intensional logics without iterative axioms. J. Philos. Log. 26(4), 391\u2013409 (1997)","journal-title":"J. Philos. Log."},{"key":"9815_CR23","doi-asserted-by":"publisher","unstructured":"Van De Putte, F., McNamara, P.: Neighbourhood canonicity for ek, eck, and relatives: A constructive proof. Rev. Symbol. Log, 1\u201317. https:\/\/doi.org\/10.1017\/S1755020321000319 (2021)","DOI":"10.1017\/S1755020321000319"},{"issue":"2","key":"9815_CR24","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S1571-0661(05)82606-4","volume":"85","author":"W van der Hoek","year":"2004","unstructured":"van der Hoek, W., Lomuscio, A.: A logic for ignorance. Electron. Notes Theor. Comput. Sci. 85 (2), 117\u2013133 (2004). lCMAS 2003, Logic and Communication in Multi-Agent Systems","journal-title":"Electron. Notes Theor. Comput. Sci."}],"updated-by":[{"DOI":"10.1007\/s10472-022-09825-y","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T00:00:00Z","timestamp":1680652800000}}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09815-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-022-09815-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-022-09815-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,5]],"date-time":"2024-10-05T13:34:09Z","timestamp":1728135249000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-022-09815-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,10]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["9815"],"URL":"https:\/\/doi.org\/10.1007\/s10472-022-09815-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,10]]},"assertion":[{"value":"24 August 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2023","order":3,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":4,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":5,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10472-022-09825-y","URL":"https:\/\/doi.org\/10.1007\/s10472-022-09825-y","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Partial financial support was received by the first author by MOE Liberal arts and Social Sciences Foundation (project no. 20YJC7204002).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}