The blackboard model of problem solving
AI Magazine
Knowledge and implicit knowledge in a distributed environment
Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
Logics of time and computation
Logics of time and computation
Knowledge and common knowledge in a distributed environment
Journal of the ACM (JACM)
A characterization of eventual Byzantine agreement
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Knowledge and common knowledge in a byzantine environment: crash failures
Information and Computation
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Properties of independently axiomatizable bimodal logics
Journal of Symbolic Logic
What can machines know?: On the properties of knowledge in distributed systems
Journal of the ACM (JACM)
First steps in modal logic
Reasoning about knowledge
Journal of Symbolic Logic
Common knowledge and update in finite environments
Information and Computation
Distributed Algorithms
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Knowledge Based Programs: On the Complexity of Perfect Recall in Finite Environments
Proceedings of the Sixth Conference on Theoretical Aspects of Rationality and Knowledge
Finite State Implementations of Knowledge-Based Programs
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
A Spectrum of Modes of Knowledge Sharing between Agents
ATAL '99 6th International Workshop on Intelligent Agents VI, Agent Theories, Architectures, and Languages (ATAL),
A logic for semi-public communication in multi-agent systems
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Multi-agent Logics of Dynamic Belief and Knowledge
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
On Multi-agent Systems Specification via Deontic Logic
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Verifying epistemic properties of multi-agent systems via bounded model checking
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
Multi-Agent Dynamic Logics with Informational Test
Annals of Mathematics and Artificial Intelligence
Extending interpreted systems with some deontic concepts
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Interpreted systems and Kripke models for multiagent systems from a categorical perspective
Theoretical Computer Science
DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies
A logic for knowledge, correctness, and real time
CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Verifying Epistemic Properties of Multi-agent Systems via Bounded Model Checking
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Hi-index | 0.00 |
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 systems and hypercubes. 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 of weakly directed frames. We provide a sound and complete axiomatization, S5WDn of this logic, and study its computational complexity. Finally, we show that under certain natural assumptions, in a model where knowledge evolves over time, S5WDn characteristics the properties of knowledge not just at the initial configuration, but also at all later configurations. In this particular, this holds for homogeneous 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.