LIPIcs.CONCUR.2019.29.pdf
- Filesize: 0.62 MB
- 15 pages
Document
Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents
Authors
-
Part of:
Volume:
30th International Conference on Concurrency Theory (CONCUR 2019)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Concurrency Theory (CONCUR) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2019-08-20
Cite As Get BibTex
Michell Guzmán, Sophia Knight, Santiago Quintero, Sergio Ramírez, Camilo Rueda, and Frank Valencia. Reasoning About Distributed Knowledge of Groups with Infinitely Many Agents. In 30th International Conference on Concurrency Theory (CONCUR 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 140, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
https://doi.org/10.4230/LIPIcs.CONCUR.2019.29
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. 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.
Subject Classification
ACM Subject Classification
- Theory of computation → Concurrency
- Theory of computation → Distributed computing models
- Theory of computation → Semantics and reasoning
Keywords
- Reasoning about Groups
- Distributed Knowledge
- Infinitely Many Agents
- Reasoning about Space
- Algebraic Modeling
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
-
Samson Abramsky and Achim Jung. Domain Theory. In Samson Abramsky et al., editors, Handbook of Logic in Computer Science, volume 3, pages 1-168. Oxford University Press, 1994.
-
Frank S. Boer, Alessandra Di Pierro, and Catuscia Palamidessi. Nondeterminism and infinite computations in constraint programming. Theoretical Computer Science, pages 37-78, 1995.
-
Brian A Davey and Hilary A Priestley. Introduction to lattices and order. Cambridge university press, 2nd edition, 2002.
-
Joan-María Esteban and Debraj Ray. On the Measurement of Polarization. Econometrica, 62(4):819-851, 1994.
-
Ronald Fagin, Joseph Y Halpern, Yoram Moses, and Moshe Y Vardi. Reasoning about knowledge. MIT press Cambridge, 4th edition, 1995.
-
Gerhard Gierz, Karl Heinrich Hofmann, Klaus Keimel, Jimmie D. Lawson, Michael Mislove, and Dana S. Scott. Continuous lattices and domains. Cambridge University Press, 2003.
- Michell Guzmán, Stefan Haar, Salim Perchy, Camilo Rueda, and Frank Valencia. Belief, Knowledge, Lies and Other Utterances in an Algebra for Space and Extrusion. Journal of Logical and Algebraic Methods in Programming, 2016. URL: https://hal.inria.fr/hal-01257113.
- Michell Guzman, Salim Perchy, Camilo Rueda, and Frank Valencia. Deriving Inverse Operators for Modal Logic. In Theoretical Aspects of Computing - ICTAC 2016, volume 9965 of Lecture Notes in Computer Science, pages 214-232. Springer, 2016. URL: https://hal.inria.fr/hal-01328188.
- Michell Guzmán, Salim Perchy, Camilo Rueda, and Frank Valencia. Characterizing Right Inverses for Spatial Constraint Systems with Applications to Modal Logic. Theoretical Computer Science, 744(56-77), October 2018. URL: https://hal.inria.fr/hal-01675010.
- Stefan Haar, Salim Perchy, Camilo Rueda, and Frank Valencia. An Algebraic View of Space/Belief and Extrusion/Utterance for Concurrency/Epistemic Logic. In 17th International Symposium on Principles and Practice of Declarative Programming (PPDP 2015), pages 161-172. ACM SIGPLAN, 2015. URL: https://hal.inria.fr/hal-01256984.
-
Joseph Y Halpern. Using reasoning about knowledge to analyze distributed systems. Annual review of computer science, 2(1):37-68, 1987.
-
Joseph Y Halpern and Yoram Moses. Knowledge and common knowledge in a distributed environment. Journal of the ACM (JACM), 37(3):549-587, 1990.
-
Joseph Y Halpern and Richard A Shore. Reasoning about common knowledge with infinitely many agents. Information and Computation, 191(1):1-40, 2004.
-
Werner Hildenbrand. On economies with many agents. Journal of Economic Theory, 2(2):161-188, 1970.
- Sophia Knight, Catuscia Palamidessi, Prakash Panangaden, and Frank D. Valencia. Spatial and Epistemic Modalities in Constraint-Based Process Calculi. In CONCUR 2012 - 23rd International Conference on Concurrency Theory, volume 7454 of Lecture Notes in Computer Science, pages 317-332. Springer, 2012. URL: https://hal.archives-ouvertes.fr/hal-00761116.
-
Sophia Knight, Prakash Panangaden, and Frank Valencia. Computing with Epistemic and Spatial Modalities. Submitted for journal publication, 2019.
- Camilo Rueda and Frank Valencia. On validity in modelization of musical problems by CCP. Soft Computing, 8(9):641-648, 2004. URL: https://doi.org/10.1007/s00500-004-0390-7.
- Vijay A. Saraswat, Martin Rinard, and Prakash Panangaden. The Semantic Foundations of Concurrent Constraint Programming. In Proceedings of the 18th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL '91, pages 333-352. ACM, 1991. URL: https://doi.org/10.1145/99583.99627.