Resolving Distributed Knowledge
Thomas {\AA}gotnes (University of Bergen), Y\`i N. W\'ang (Zhejiang, University)

TL;DR
This paper introduces resolution operators in epistemic logic to model the process of group members sharing information, and provides axiomatizations for logics combining these with common and distributed knowledge.
Contribution
It defines the R_G operator to represent shared information after group communication and offers sound and complete axiomatizations for related logics.
Findings
Resolution operators model shared group knowledge.
Axiomatizations for combined logics are established.
The relationship between distributed and common knowledge is clarified.
Abstract
Distributed knowledge is the sum of the knowledge in a group; what someone who is able to discern between two possible worlds whenever any member of the group can discern between them, would know. Sometimes distributed knowledge is referred to as the potential knowledge of a group, or the joint knowledge they could obtain if they had unlimited means of communication. In epistemic logic, the formula D_G{\phi} is intended to express the fact that group G has distributed knowledge of {\phi}, that there is enough information in the group to infer {\phi}. But this is not the same as reasoning about what happens if the members of the group share their information. In this paper we introduce an operator R_G, such that R_G{\phi} means that {\phi} is true after G have shared all their information with each other - after G's distributed knowledge has been resolved. The R_G operators are called…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
