research-article

(Arbitrary) Partial Communication

Authors:

Rustam Galimullin,

Fernando R. Vel�zquez-QuesadaAuthors Info & Claims

AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

Pages 400 - 408

Published: 30 May 2023 Publication History

Abstract

Communication within groups of agents has been lately the focus of research in dynamic epistemic logic (DEL). This paper studies a recently introduced form of partial (more precisely, topic-based) communication. This type of communication allows for modelling scenarios of multi-agent collaboration and negotiation, and it is particularly well-suited for situations in which sharing all information is not feasible/advisable. After presenting results on invariance and complexity of model checking, the paper compares partial communication to public announcements, probably the most well-known type of communication in DEL. It is shown that the settings are, update-wise, incomparable: there are scenarios in which the effect of a public announcement cannot be replicated by partial communication, and vice versa. Then, the paper shifts its attention to strategic topic-based communication. It does so by extending the language with a modality that quantifies over the topics the agents can 'talk about'. For this new framework, it provides a complete axiomatisation, showing also that the new language's model checking problem isPSPACE -complete. The paper closes showing that, in terms of expressivity, this new language of arbitrary partial communication is incomparable to that of arbitrary public announcements.

References

[1]

Thomas �gotnes, Natasha Alechina, and Rustam Galimullin. 2022. Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power. Journal of Logic, Language and Information, Vol. 31, 2 (2022), 141--166. https://doi.org/10.1007/s10849-022-09355-0

Digital Library

[2]

Thomas Ågotnes, Philippe Balbiani, Hans van Ditmarsch, and Pablo Seban. 2010. Group announcement logic. Journal of Applied Logic, Vol. 8, 1 (2010), 62--81. https://doi.org/10.1016/j.jal.2008.12.002

[3]

Thomas Ågotnes and Y`i N. Wá ng. 2017. Resolving distributed knowledge. Artificial Intelligence, Vol. 252 (2017), 1--21. https://doi.org/10.1016/j.artint.2017.07.002

Digital Library

[4]

Natasha Alechina, Hans van Ditmarsch, Rustam Galimullin, and Tuo Wang. 2021. Verification and Strategy Synthesis for Coalition Announcement Logic. Journal of Logic, Language and Information, Vol. 30, 4 (2021), 671--700. https://doi.org/10.1007/s10849-021-09339--6

Digital Library

[5]

Guillaume Aucher and Francc ois Schwarzentruber. 2013. On the Complexity of Dynamic Epistemic Logic. In Proceedings of the 14th TARK, Burkhard C. Schipper (Ed.).

[6]

Philippe Balbiani, Alexandru Baltag, Hans van Ditmarsch, Andreas Herzig, Tomohiro Hoshi, and Tiago de Lima. 2008. 'Knowable' as 'known after an announcement'. The Review of Symbolic Logic, Vol. 1, 3 (2008), 305--334. https://doi.org/10.1017/S1755020308080210

[7]

Philippe Balbiani and Hans van Ditmarsch. 2015. A simple proof of the completeness of APAL. Studies in Logic, Vol. 8, 2 (2015), 65--78.

[8]

Alexandru Baltag. 2010. What is DEL good for? (2010). http://ai.stanford.edu/ epacuit/lograt/esslli2010-slides/copenhagenesslli.pdf Workshop on Logic, Rationality and Intelligent Interaction.

[9]

Alexandru Baltag, Lawrence S. Moss, and Sławomir Solecki. 1998. The Logic of Public Announcements and Common Knowledge and Private Suspicions. In Proceedings of the 7th TARK, Itzhak Gilboa (Ed.). Morgan Kaufmann, 43--56.

[10]

Alexandru Baltag and Sonja Smets. 2020. Learning What Others Know. In LPAR 2020 (EPiC Series in Computing, Vol. 73), Elvira Albert and Laura Ková cs (Eds.). EasyChair, 90--119. https://doi.org/10.29007/plm4

[11]

Alexandru Baltag and Sonja Smets. 2021. Learning What Others Know. CoRR, Vol. abs/2109.07255 (2021). showeprint[arXiv]2109.07255 https://arxiv.org/abs/2109.07255

[12]

Boudewijn de Bruin. 2010. Explaining Games: The Epistemic Programme in Game Theory. Springer, Dordrecht. https://doi.org/10.1007/978--1--4020--9906--9

[13]

Ronald de Haan and Iris van de Pol. 2021. On the Computational Complexity of Model Checking for Dynamic Epistemic Logic with S5 Models. FLAP, Vol. 8, 3 (2021), 621--658.

[14]

Ronald Fagin, Joseph Y. Halpern, Yoram Moses, and Moshe Y. Vardi. 1995. Reasoning about knowledge. The MIT Press, Cambridge, Mass.

[15]

Rustam Galimullin and Thomas �gotnes. 2021. Quantified Announcements and Common Knowledge. In Proceegins of the 20th AAMAS, Frank Dignum, Alessio Lomuscio, Ulle Endriss, and Ann Now� (Eds.). ACM, 528--536. https://dl.acm.org/doi/10.5555/3463952.3464018

[16]

Rustam Galimullin and Fernando R. Vel�zquez-Quesada. 2023. (Arbitrary) Partial Communication. https://doi.org/10.48550/ARXIV.2302.12090 showeprint[arXiv]2109.07255

[17]

Jelle Gerbrandy and Willem Groeneveld. 1997. Reasoning about information change. Journal of Logic, Language, and Information, Vol. 6, 2 (1997), 147--196. https://doi.org/10.1023/A:1008222603071

Digital Library

[18]

Robert Goldblatt. 1982. Axiomatising the Logic of Computer Programming. LNCS, Vol. 130. Springer. https://doi.org/10.1007/BFb0022481

[19]

Joseph Y. Halpern and Yoram Moses. 1990. Knowledge and Common Knowledge in a Distributed Environment. Journal of the ACM, Vol. 37, 3 (1990), 549--587. https://doi.org/10.1145/79147.79161

Digital Library

[20]

Joseph Y. Halpern and Yoram Moses. 1992. A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief. Artificial Intelligence, Vol. 54, 2 (1992), 319--379. https://doi.org/10.1016/0004--3702(92)90049--4

Digital Library

[21]

Vincent F. Hendricks (Ed.). 2006. 8 Bridges between Formal and Mainstream Epistemology. Philosophical Studies, 128(1).

[22]

Jaakko Hintikka. 1962. Knowledge and Belief. Cornell University Press, Ithaca, N.Y.

[23]

Paris C. Kanellakis and Scott A. Smolka. 1990. CCS Expressions, Finite State Processes, and Three Problems of Equivalence. Information and Computation, Vol. 86, 1 (1990), 43--68. https://doi.org/10.1016/0890--5401(90)90025-D

Digital Library

[24]

Barteld Kooi and Bryan Renne. 2011. Arrow Update Logic. The Review of Symbolic Logic, Vol. 4, 4 (2011), 536--559. https://doi.org/10.1017/S1755020311000189

[25]

Louwe B. Kuijer. 2015. An Arrow-based Dynamic Logic of Norms. In Proceedings of the 3rd SR, Julian Gutierrez, Fabio Mogavero, Aniello Murano, and Michael Wooldridge (Eds.). 1--11.

[26]

Carsten Lutz. 2006. Complexity and succinctness of public announcement logic. In Proceedings of the 5th AAMAS, Hideyuki Nakashima, Michael P. Wellman, Gerhard Weiss, and Peter Stone (Eds.). ACM, 137--143. https://doi.org/10.1145/1160633.1160657

Digital Library

[27]

John-Jules Ch. Meyer and Wiebe van der Hoek. 1995. Epistemic Logic for AI and Computer Science. CUP. https://doi.org/10.1017/CBO9780511569852

[28]

Jan A. Plaza. 1989. Logics of public communications. In Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems, M. L. Emrich, M. S. Pfeifer, M. Hadzikadic, and Z. W. Ras (Eds.). 201--216.

[29]

Floris Roelofsen. 2005. Bisimulation and Distributed Knowledge Revisited. (2005). Available at https://projects.illc.uva.nl/lgc/papers/d-know.pdf.

[30]

Floris Roelofsen. 2007. Distributed knowledge. Journal of Applied Non-Classical Logics, Vol. 17, 2 (2007), 255--273. https://doi.org/10.3166/jancl.17.255--273

[31]

Johan van Benthem. 2011. Logical Dynamics of Information and Interaction. CUP.

[32]

Johan van Benthem and Fenrong Liu. 2007. Dynamic logic of preference upgrade. Journal of Applied Non-Classical Logics, Vol. 17, 2 (2007), 157--182. https://doi.org/10.3166/jancl.17.157--182

[33]

Hans van Ditmarsch. 2003. The Russian Cards Problem. Studia Logica, Vol. 75, 1 (2003), 31--62. https://doi.org/10.1023/A:1026168632319

[34]

Hans van Ditmarsch. 2014. Dynamics of lying. Synthese, Vol. 191, 5 (2014), 745--777. https://doi.org/10.1007/s11229-013-0275--3

[35]

Hans van Ditmarsch. 2020. To Be Announced. CoRR, Vol. abs/2004.05802 (2020). showeprint[arXiv]2004.05802 https://arxiv.org/abs/2004.05802

[36]

Hans van Ditmarsch, David Fern�ndez-Duque, and Wiebe van der Hoek. 2014. On the definability of simulation and bisimulation in epistemic logic. Journal of Logic and Computation, Vol. 24, 6 (2014), 1209--1227. https://doi.org/10.1093/logcom/exs058

[37]

Hans van Ditmarsch, Wiebe van der Hoek, and Barteld Kooi. 2008. Dynamic Epistemic Logic. Springer, Dordrecht, The Netherlands. https://doi.org/10.1007/978--1--4020--5839--4

[38]

Hans van Ditmarsch, Wiebe van der Hoek, Barteld Kooi, and Louwe B. Kuijer. 2017. Arbitrary arrow update logic. Artificial Intelligence, Vol. 242 (2017), 80--106. https://doi.org/10.1016/j.artint.2016.10.003

Digital Library

[39]

Fernando R. Vel�zquez-Quesada. 2022. Communication between agents in dynamic epistemic logic. CoRR, Vol. abs/2210.04656 (2022). https://doi.org/10.48550/arXiv.2210.04656 showeprint[arXiv]2210.04656

[40]

Yanjing Wang and Qinxiang Cao. 2013. On axiomatizations of public announcement logic. Synthese, Vol. 190, Supplement-1 (2013), 103--134. https://doi.org/10.1007/s11229-012-0233--5

[41]

Yi N. W�ng and Thomas �gotnes. 2013. Public announcement logic with distributed knowledge: expressivity, completeness and complexity. Synthese, Vol. 190, Supplement-1 (2013), 135--162. https://doi.org/10.1007/s11229-012-0243--3

Cited By

Dolgorukov VGalimullin RGladyshev MDastani MSichman JAlechina NDignum V(2024)Dynamic Epistemic Logic of Resource Bounded Information Mining AgentsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662898(481-489)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662898

Index Terms

(Arbitrary) Partial Communication
1. Theory of computation
  1. Logic
    1. Modal and temporal logics

Recommendations

Building epistemic logic from observations and public announcements
KR'16: Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning

We study an epistemic logic where knowledge is built from what the agents observe (including higher-order visibility) and what the agents learn from public announcements. This fixes two main drawbacks of previous observability-based approaches where who ...
Arbitrary Announcements on Topological Subset Spaces
Multi-Agent Systems
Abstract
Subset space semantics for public announcement logic in the spirit of the effort modality have been proposed by Wang and �gotnes [18] and by Bjorndahl [6]. They propose to model the public announcement modality by shrinking the epistemic range ...
A Semantics for Hyperintensional Belief Revision Based on Information Bases
Abstract
I propose a novel hyperintensional semantics for belief revision and a corresponding system of dynamic doxastic logic. The main goal of the framework is to reduce some of the idealisations that are common in the belief revision literature and in ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

AAMAS '23: Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems

May 2023

3131 pages

ISBN:9781450394321

General Chairs:
Noa Agmon
Bar-Ilan University, Israel
,
Bo An
Nanyang Technological University, Singapore
,
Program Chairs:
Alessandro Ricci
University of Bologna, Italy
,
William Yeoh
Washington University in St. Louis, USA

Sponsors

Publisher

International Foundation for Autonomous Agents and Multiagent Systems

Richland, SC

Publication History

Published: 30 May 2023

Check for updates

Author Tags

Qualifiers

Research-article

Conference

AAMAS '23

Sponsor:

SIGAI

AAMAS '23: International Conference on Autonomous Agents and Multiagent Systems

May 29 - June 2, 2023

London, United Kingdom

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
29
Total Downloads

Downloads (Last 12 months)11
Downloads (Last 6 weeks)0

Reflects downloads up to 19 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Dolgorukov VGalimullin RGladyshev MDastani MSichman JAlechina NDignum V(2024)Dynamic Epistemic Logic of Resource Bounded Information Mining AgentsProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662898(481-489)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662898

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents