Abstract
Simplicial complexes are a versatile and convenient paradigm on which to build all the tools and techniques of the logic of knowledge, on the assumption that initial epistemic models can be described in a distributed fashion. Thus, we can define: knowledge, belief, bisimulation, the group notions of mutual, distributed and common knowledge, and also dynamics in the shape of simplicial action models. We give a survey on how to interpret all such notions on simplicial complexes, building upon the foundations laid in Goubault et al. (Inf Comput 278:104597, 2021).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Instead of atoms P, considers atoms P × A, where we write p a for (p, a). For each agent a, let P a be the set of all p a that are local for a. Now, all P a are disjoint.
- 2.
In a subdivision of a (pure chromatic) simplicial complex we replace simplexes by sets of simplexes of the same dimension. For general definitions see Herlihy et al. (2013).
- 3.
There is no agreement on terminology here. The notion that everybody knows φ (which is unambiguous) is in different communities called: shared knowledge, mutual knowledge, general knowledge; where in some communities some of these terms mean common knowledge instead, creating further confusion.
- 4.
The intuition puts one on the wrong foot for distributedly known ignorance: it may be distributed knowledge between a and b that ‘p is true and b is ignorant of p’, but this cannot be made common knowledge between them. If a were to inform b of this, they would then have common knowledge between them of p, but they would not have common knowledge between them of ‘p is true and b does not know p’.
- 5.
Local semantics can also be given for distributed knowledge and for common knowledge. For example, to determine what a and b commonly know on the edge {a0, b1} we need to consider facets bordering on the chain a0—b1—a1—b0 only. For example, \(\mathcal C, \{a0,b1\} \models K_a \neg p_a\) whereas \(\mathcal C,\{a0,b1\} \not \models C_{ab} \neg p_a\).
- 6.
The epistemic model equivalent would be: \({\sim ^{*\cap }_m} := (\bigcup _{B \subseteq A}^{|B|=m+1} \sim ^\cap _B)^*\).
- 7.
Personal communication by Alexandru Baltag.
- 8.
In logics that contains modalities for such action models, we need to require that \(\mathcal V(C)\) is finite and that p o s t is a partial function defined for a finite subset P′⊆ P only.
- 9.
Using local semantics, instead of \(\mathcal C,X \models \bigwedge _{v' \in X'} \mathsf {pre}'(v')\) we can require that \(\mathcal C, v \models \mathsf {pre}'(v')\) for all v ∈ X and v′∈ X′ with χ(v) = χ(v′). This may be more elegant.
- 10.
If we were to incorporate modalities for simplicial action models into the logical language, we can also express propositions such as ‘before the update c did not know the value of b’s variable, but afterwards she knows’: \(\mathcal C, F_4 \models \neg (K_c p_b \vee K_c \neg p_b) \wedge [\mathcal C',F^{\prime }_2] (K_c p_b \vee K_c \neg p_b)\).
References
Ågotnes, T., and Y.N. Wáng. 2017. Resolving Distributed Knowledge. Artificial Intelligence 252: 1–21.
Aguilera, M.K. 2004. A Pleasant Stroll Through the Land of Infinitely Many Creatures. SIGACT News, 35(2): 36–59.
Alur, R., T.A. Henzinger, and O. Kupferman. 2002. Alternating-Time Temporal Logic. Journal of the ACM 49: 672–713.
Baier, C., and J.-P. Katoen. 2008. Principles of Model Checking. Cambridge: The MIT Press.
Balbiani, P., H. van Ditmarsch, and S. Fernández González. 2019. Asynchronous announcements. CoRR, abs/1705.03392.
Baltag, A., L.S. Moss, and S. Solecki. 1998. The logic of public announcements, common knowledge, and private suspicions. In Proc. of 7th TARK, 43–56. Burlington: Morgan Kaufmann.
Baltag, A., and S. Smets. 2008. A qualitative theory of dynamic interactive belief revision. In Proc. of 7th LOFT, Texts in Logic and Games 3, 13–60. Amsterdam University Press.
Baltag, A., and S. Smets. 2020. Learning what others know. In Proc. of 23rd LPAR, eds. E. Albert and L. Kovacs, EPiC Series in Computing, vol. 73, 90–119.
Banerjee, M., and Md.A. Khan. 2007. Propositional Logics from Rough Set Theory. Transactions on Rough Sets VI 6: 1–25.
Biran, O., S. Moran, and S. Zaks. 1990. A Combinatorial Characterization of the Distributed 1-Solvable Tasks. Journal of Algorithms 11(3): 420–440.
Blackburn, P. 2000. Representation, Reasoning, and Relational Structures: A Hybrid Logic Manifesto. Logic Journal of the IGPL 8(3): 339–365.
Blackburn, P., M. de Rijke, and Y. Venema. 2001. Modal Logic. Cambridge Tracts in Theoretical Computer Science 53. Cambridge: Cambridge University Press.
Bracho, J., and L. Montejano. 1987. The Combinatorics of Colored Triangulations of Manifolds. Geometriae Dedicata 22(3): 303–328.
Brandt, F., V. Conitzer, U. Endriss, J. Lang, and A.D. Procaccia, eds. 2016. Handbook of Computational Social Choice. Cambridge: Cambridge University Press.
Charrier, T., and F. Schwarzentruber. 2015. Arbitrary Public Announcement Logic with Mental Programs. In Proc. of AAMAS, 1471–1479. New York: ACM.
Chellas, B.F. 1980. Modal Logic: An Introduction. Cambridge: Cambridge University Press.
Dabrowski, A., L.S. Moss, and R. Parikh. 1996. Topological Reasoning and the Logic of Knowledge. Annals of Pure and Applied Logic 78(1–3): 73–110.
Degremont, C., B. Löwe, and A. Witzel. 2011. The Synchronicity of Dynamic Epistemic Logic. In Proc. of 13th TARK, 145–152. New York: ACM.
Dixon, C., C. Nalon, and R. Ramanujam. 2015. Knowledge and Time. In Handbook of Epistemic Logic, eds. H. van Ditmarsch, J.Y. Halpern, W. van der Hoek, and B. Kooi, 205–259. London: College Publications.
Edelsbrunner, H., and J. Harer. 2010. Computational Topology - An Introduction. Providence: American Mathematical Society.
Fagin, R., and J.Y. Halpern. 1988. Belief, Awareness, and Limited Reasoning. Artificial Intelligence 34(1): 39–76.
Fagin, R., J.Y. Halpern, Y. Moses, and M.Y. Vardi. 1995. Reasoning about Knowledge. Cambridge: MIT Press.
Fischer, M.J., N.A. Lynch, and M. Paterson. 1985. Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32(2): 374–382.
Fisler, K., and M.Y. Vardi. 2002. Bisimulation Minimization and Symbolic Model Checking. Formal Methods in System Design 21(1): 39–78.
Fraigniaud, P., S. Rajsbaum, and C. Travers. 2013. Locality and Checkability in Wait-Free Computing. Distributed Computing 26(4): 223–242.
Friedell, M. 1969. On the Structure of Shared Awareness. Behavioral Science 14: 28–39.
Goubault, E., M. Lazic, J. Ledent, and S. Rajsbaum. 2019. Wait-Free Solvability of Equality Negation Tasks. In Proc. of 33rd DISC, 21:1–21:16.
Goubault, E., J. Ledent, and S. Rajsbaum. 2021. A Simplicial Complex Model for Dynamic Epistemic Logic to Study Distributed Task Computability. Information and Computation 278: 104597.
Halpern, J.Y., and Y. Moses. 1990. Knowledge and Common Knowledge in a Distributed Environment. Journal of the ACM 37(3): 549–587.
Halpern, J.Y., and Y. Moses. 2017. Characterizing Solution Concepts in Terms of Common Knowledge of Rationality. International Journal of Game Theory 46(2): 457–473.
Harel, D., D. Kozen, and J. Tiuryn. 2000. Dynamic Logic. Foundations of Computing Series. Cambridge, MA: MIT Press.
Hatcher, A. 2002. Algebraic Topology. Cambridge: Cambridge Univ. Press.
Hayek, F. 1945. The Use of Knowledge in Society. American Economic Review 35: 519–530.
Herlihy, M., D. Kozlov, and S. Rajsbaum. 2013. Distributed Computing Through Combinatorial Topology. San Francisco, CA: Morgan Kaufmann
Herlihy, M., and N. Shavit. 1993. The asynchronous computability theorem for t-resilient tasks. In Proc. 25th Annual ACM Symposium on Theory of Computing, 111–120.
Herlihy, M., and N. Shavit. 1999. The Topological Structure of Asynchronous Computability. Journal of the ACM 46(6): 858–923.
Hilton, P.J., and S. Wylie. 1960. Homology Theory: An Introduction to Algebraic Topology. Cambridge: Cambridge University Press.
Hintikka, J. 1962. Knowledge and Belief. An Introduction to the Logic of the Two Notions. Ithaca: Cornell University Press.
Knight, S. 2013. The Epistemic View of Concurrency Theory. PhD thesis, École Polytechnique, Palaiseau.
Knight, S., B. Maubert, and F. Schwarzentruber. 2019. Reasoning About Knowledge and Messages in Asynchronous Multi-Agent Systems. Mathematical Structures in Computer Science 29(1): 127–168.
Kozlov, D. 2008. Combinatorial Algebraic Topology. Berlin: Springer.
Lamport, L. 1978. Time, Clocks, and the Ordering of Events in a Distributed System. Communications of the ACM 21(7): 558–565.
Ledent, J. 2019. Geometric Semantics for Asynchronous Computability. PhD thesis, École Polytechnique, Palaiseau.
Lewis, D.K. 1969. Convention, a Philosophical Study. Cambridge: Harvard University Press.
Loui, M.C., and H.H. Abu-Amara. 1987. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. Advances in Computing Research 4: 163–183.
Meyer, J.-J.Ch., and W. van der Hoek. 1995. Epistemic Logic for AI and Computer Science. Cambridge Tracts in Theoretical Computer Science 41. Cambridge: Cambridge University Press.
Osborne, M.J., and A. Rubinstein. 1994. A Course in Game Theory. Cambridge: MIT Press.
Özgün, A. 2017. Evidence in Epistemic Logic: A Topological Perspective. PhD thesis, University of Lorraine & University of Amsterdam.
Pacuit, E. 2017. Neighborhood Semantics for Modal Logic. Berlin: Springer.
Paige, R., and R.E. Tarjan. 1987. Three Partition Refinement Algorithms. SIAM Journal on Computing 16(6): 973–989.
Panangaden, P., and K. Taylor. 1992. Concurrent Common Knowledge: Defining Agreement for Asynchronous Systems. Distributed Computing 6: 73–93.
Parikh, R., L.S. Moss, and C. Steinsvold. 2007. Topology and epistemic logic. In Handbook of Spatial Logics, eds. M. Aiello, I. Pratt-Hartmann, and J. van Benthem, 299–341. Berlin: Springer.
Peleg, D. 1987. Concurrent Dynamic Logic. Journal of the ACM 34(2): 450–479.
Pnueli, A. 1977. The temporal logic of programs. In Proc. of 18th FOCS, 46–57. Los Alamitos : IEEE Computer Society.
Porter, T. 2002. Geometric Aspects of Multiagent Systems. Electronic Notes in Theoretical Computer Science 81: 73–98.
Roelofsen, F. 2007. Distributed Knowledge. Journal of Applied Non-Classical Logics 17(2): 255–273.
Rotman, J. 1973. Covering Complexes with Applications to Algebra. The Rocky Mountain Journal of Mathematics 3(4): 641–674.
Sangiorgi, D. 2011. An Introduction to Bisimulation and Coinduction. Cambridge: Cambridge University Press.
van Benthem, J. 1998. Dynamic odds and ends. Technical report, University of Amsterdam. ILLC Research Report ML-1998-08.
van Benthem, J. 2010. Modal Logic for Open Minds. Stanford, CA: Center for the Study of Language and Information.
van Benthem, J., and S. Smets. 2015. Dynamic logics of belief change. In Handbook of Epistemic Logic, eds. H. van Ditmarsch, J.Y. Halpern, W. van der Hoek, and B. Kooi, 313–394. London: College Publications.
van Benthem, J., J. van Eijck, M. Gattinger, and K. Su. 2018. Symbolic Model Checking for Dynamic Epistemic Logic - S5 and Beyond. Journal of Logic and Computation 28(2): 367–402.
van Benthem, J., J. van Eijck, and B. Kooi. 2006. Logics of Communication and Change. Information and Computation 204(11): 1620–1662.
van Ditmarsch, H., D. Fernández-Duque, and W. van der Hoek. 2014. On the Definability of Simulation and Bisimulation in Epistemic Logic. Journal of Logic and Computation 24(6): 1209–1227.
van Ditmarsch, H., and T. French. 2009. Awareness and forgetting of facts and agents. In Proc. of WI-IAT Workshops 2009, eds. P. Boldi, G. Vizzari, G. Pasi, and R. Baeza-Yates, 478–483. Hoboken: IEEE Press.
van Ditmarsch, H., E. Goubault, M. Lazic, J. Ledent, and S. Rajsbaum. 2021. A Dynamic Epistemic Logic Analysis of Equality Negation and Other Epistemic Covering Tasks. Journal of Logical and Algebraic Methods in Programming 121: 100662.
van Ditmarsch, H., J.Y. Halpern, W. van der Hoek, and B. Kooi, eds. 2015. Handbook of Epistemic Logic. London: College Publications.
van Ditmarsch, H., and B. Kooi. 2008. Semantic results for ontic and epistemic change. In Proc. of 7th LOFT, Texts in Logic and Games 3, 87–117. Amsterdam: Amsterdam University Press.
van Ditmarsch, H., W. van der Hoek, and B. Kooi. 2008. Dynamic Epistemic Logic. Volume 337 of Synthese Library. Berlin: Springer.
van Ditmarsch, H., J. van Eijck, and R. Verbrugge. 2009. Common knowledge and common belief. In Discourses on Social Software, J. van Eijck and R. Verbrugge, 99–122. Amsterdam: Amsterdam University Press.
van Glabbeek, R.J. 1990. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, Vrije Universiteit Amsterdam.
van Wijk, S. 2015. Coalitions in epistemic planning. Technical report, University of Amsterdam. ILLC report MoL-2015-26 (MSc thesis).
Acknowledgements
We thank the reviewers for their very detailed comments. The second author was partially supported by AID project “Validation of Autonomous Drones and Swarms of Drones” and the academic chair “Complex Systems Engineering” of École Polytechnique-ENSTA-Télécom-Thalès-Dassault-Naval Group-DGA-FX-Fondation ParisTech. The fourth author was partially supported by grants UNAM-PAPIIT IN106520 and CONACYT-LASOL.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Ditmarsch, H.v., Goubault, É., Ledent, J., Rajsbaum, S. (2022). Knowledge and Simplicial Complexes. In: Lundgren, B., Nuñez Hernández, N.A. (eds) Philosophy of Computing. Philosophical Studies Series, vol 143. Springer, Cham. https://doi.org/10.1007/978-3-030-75267-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-030-75267-5_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-75266-8
Online ISBN: 978-3-030-75267-5
eBook Packages: Religion and PhilosophyPhilosophy and Religion (R0)