Reasoning about distributed information with infinitely many agents

Abstract 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. For completely distributive lattices, we establish that the distributed information of c amongst a group is the greatest lower bound of all possible combinations of information in the spaces of the agents in the group that derive c. 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 an application on mathematical morphology where dilations, one of its fundamental operations, define an scs on a powerset lattice. We show that distributed information represents a particular dilation in such scs.

[1]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[2]  Santiago Quintero,et al.  Counting and Computing Join-Endomorphisms in Lattices , 2020, RAMiCS.

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

[4]  Robert Goldblatt,et al.  Algebraic Polymodal Logic: A Survey , 2000, Log. J. IGPL.

[5]  Alessandra Palmigiano,et al.  Epistemic Updates on Algebras , 2013, Log. Methods Comput. Sci..

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

[7]  Valentin Zelenyuk,et al.  Aggregation of scale efficiency , 2015, Eur. J. Oper. Res..

[8]  Yeneng Sun,et al.  Modeling infinitely many agents , 2017 .

[9]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

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

[11]  Michell Guzmán,et al.  On the Expressiveness of Spatial Constraint Systems , 2017, ICLP.

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

[13]  S. Vickers.  Topology via Logic , 1989 .

[14]  Frank Valencia.  Semantic Structures for Spatially-Distributed Multi-Agent Systems , 2019, EXPRESS/SOS.

[15]  Gianluigi Bellin.  Categorical Proof Theory of Co-Intuitionistic Linear Logic , 2014, Log. Methods Comput. Sci..

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

[17]  Gina Belmonte,et al.  VoxLogicA: a Spatial Model Checker for Declarative Image Analysis (Extended Version) , 2018, TACAS.

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

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

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

[21]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

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

[23]  John Geanakoplos,et al.  Chapter 40 Common knowledge , 1994 .

[24]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[25]  R. Aumann.  Agreeing to disagree. , 1976, Nature cell biology.

[26]  Lawrence S. Moss,et al.  Topology and Epistemic Logic , 2007, Handbook of Spatial Logics.

[27]  Alessandra Palmigiano,et al.  A proof-theoretic semantic analysis of dynamic epistemic logic , 2016, J. Log. Comput..

[28]  Frank D. Valencia,et al.  Deriving Labels and Bisimilarity for Concurrent Constraint Programming , 2011, FoSSaCS.

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

[30]  A. Tarski,et al.  The Algebra of Topology , 1944 .

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

[32]  Richard Spencer-Smith,et al.  Modal Logic , 2007 .

[33]  Aybüke Özgün,et al.  Announcement as effort on topological spaces , 2017, Synthese.

[34]  Robert B. Ash.  Basic Abstract Algebra: For Graduate Students and Advanced Undergraduates , 2006 .

[35]  J. Hintikka.  Knowledge and belief , 1962 .

[36]  Joseph Y. Halpern,et al.  Handbook of epistemic logic , 2015 .

[37]  Gustav Bergmann.  The Representations of S5 , 1956, J. Symb. Log..

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

[39]  Santiago Quintero,et al.  Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents , 2019, CONCUR.

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

[41]  Isabelle Bloch,et al.  Mathematical Morphology , 2007, Handbook of Spatial Logics.

[42]  Andrew Postlewaite,et al.  Core Convergence with Asymmetric Information , 2003, Games Econ. Behav..

[43]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[44]  E. T. Schmidt,et al.  On the lattice of all join-endomorphisms of a lattice , 1958 .

[45]  W. Hildenbrand.  Core and Equilibria of a Large Economy. (PSME-5) , 2015 .

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

[47]  Sally Popkorn.  First Steps in Modal Logic , 1995 .

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

[49]  Hugues Talbot,et al.  Mathematical Morphology: from theory to applications , 2013 .

[50]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[51]  Mário S. Alvim,et al.  Toward a Formal Model for Group Polarization in Social Networks , 2019, The Art of Modelling Computational Systems.

[52]  Christian Ronse,et al.  Why mathematical morphology needs complete lattices , 1990, Signal Process..

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

[54]  J. Serra.  Introduction to mathematical morphology , 1986 .

[55]  Herbert E. Scarf,et al.  A LIMIT THEOREM ON THE CORE OF AN ECONOMY , 1963, Classics in Game Theory.