Knowledge in multiagent systems
- 1 October 2000
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computational Logic
- Vol. 1 (2) , 247-284
- https://doi.org/10.1145/359496.359527
Abstract
The semantic framework for the modal logic of knowledge due to Halpern and Moses provides a way to ascribe knowlegde to agents in distributed and multiagent systems. In this paper we study two special cases of this framework:full systemsandhypercubes. Both model static situtations in which no agents has any information about another agent's state. Full systems and hypercubes are an appropriate model for the initial configurations of many systems of interest. We establish a correspondence between full systems and hypercube systems and certain classes of Kripke frames. We show that these classes of systems correspond to the same logic. Moreover, this logic is also the same as that generated by the larger class ofweakly directed frames. We provide a sound and complete axiomatization, S5WDnof this logic, and study its computational complexity. Finally, we show that under certain natural assumptions, in a model where knowledge evolves over time, S5WDncharacteristics the properties of knowledge not just at the initial configuration, but also at all later configurations. In this particular, this holds forhomogeneous broadcast systems,which capture settings in which agents are intially ignorant of each others local states, operate synchronously, have perfect recall, and can communicate only by broadcasting.Keywords
This publication has 24 references indexed in Scilit:
- On axiomatising products of Kripke framesThe Journal of Symbolic Logic, 2000
- Complexity of products of modal logicsJournal of Logic and Computation, 1999
- Products of modal logics, part 1Logic Journal of the IGPL, 1998
- Cylindric modal logicThe Journal of Symbolic Logic, 1995
- What can machines know?Journal of the ACM, 1992
- A guide to completeness and complexity for modal logics of knowledge and beliefArtificial Intelligence, 1992
- Properties of independently axiomatizable bimodal logicsThe Journal of Symbolic Logic, 1991
- Programming simultaneous actions using common knowledgeAlgorithmica, 1988
- Nonfinitizability of classes of representable polyadic algebrasThe Journal of Symbolic Logic, 1969
- A solution of the decision problem for the Lewis systems S2 and S4, with an application to topologyThe Journal of Symbolic Logic, 1941