Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents

Spatial constraint systems (scs) are semantic structures for reasoning about spatial and epistemic information in concurrent systems. We develop the theory of scs to reason about the distributed information of potentially infinite groups. We characterize the notion of distributed information of a group of agents as the infimum of the set of join-preserving functions that represent the spaces of the agents in the group. We provide an alternative characterization of this notion as the greatest family of join-preserving functions that satisfy certain basic properties. We show compositionality results for these characterizations and conditions under which information that can be obtained by an infinite group can also be obtained by a finite group. Finally, we provide algorithms that compute the distributive group information of finite groups.

[1]  Debraj Ray,et al.  On the Measurement of Polarization , 1994 .

[2]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[3]  Camilo Rueda,et al.  On validity in modelization of musical problems by CCP , 2004, Soft Comput..

[4]  Camilo Rueda,et al.  An algebraic view of space/belief and extrusion/utterance for concurrency/epistemic logic , 2015, PPDP.

[5]  Joseph Y. Halpern,et al.  Knowledge and common knowledge in a distributed environment , 1984, JACM.

[6]  Camilo Rueda,et al.  Deriving Inverse Operators for Modal Logic , 2016, ICTAC.

[7]  Frank D. Valencia,et al.  Spatial and Epistemic Modalities in Constraint-Based Process Calculi , 2012, CONCUR.

[8]  Camilo Rueda,et al.  Belief, knowledge, lies and other utterances in an algebra for space and extrusion , 2017, J. Log. Algebraic Methods Program..

[9]  Frank S. de Boer,et al.  Nondeterminism and Infinite Computations in Constraint Programming , 1995, Theor. Comput. Sci..

[10]  Camilo Rueda,et al.  Characterizing right inverses for spatial constraint systems with applications to modal logic , 2018, Theor. Comput. Sci..

[11]  Joseph Y. Halpern,et al.  Reasoning about common knowledge with infinitely many agents , 2004, Inf. Comput..

[12]  Joseph Y. Halpern.  USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .

[13]  Werner Hildenbrand,et al.  On economies with many agents , 1970 .

[14]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[15]  Prakash Panangaden,et al.  The semantic foundations of concurrent constraint programming , 1991, POPL '91.

[16]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[17]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.