Common knowledge and update in finite environments. I: extended abstract

Authors:
Ron van der Meyden
Affiliations:
NTT Basic Research Laboratories, Tokyo, Japan
Venue:
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Year:
1994

Citing 11
Cited 3

Formal theories of knowledge in AI and robotics

New Generation Computing
The synthesis of digital machines with provable epistemic properties

Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The logic of distributed protocols

Proceedings of the 1986 Conference on Theoretical aspects of reasoning about knowledge
The complexity of reasoning about knowledge and time. I. lower bounds

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Journal of the ACM (JACM)
Agent-oriented programming

Artificial Intelligence
Knowledge-oriented programming

PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Switching and Finite Automata Theory: Computer Science Series

Switching and Finite Automata Theory: Computer Science Series
A Stubborn Attack On State Explosion

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Distributed Processes and the Logic of Knowledge

Proceedings of the Conference on Logic of Programs
Concurrent common knowledge: defining agreement for asynchronous systems

Distributed Computing

Local knowledge assertions in a changing world: extended abstract

TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
Knowledge based programs: on the complexity of perfect recall in finite environments

TARK '96 Proceedings of the 6th conference on Theoretical aspects of rationality and knowledge
A semantic characterization of an algorithm for estimating others' beliefs from observation

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the model checking problem for knowledge formulae in the S5n Kripke structures generated by finite state environments in which states determine an observation for each agent. Agents have perfect recall, and may operate synchronously or asynchronously. Common knowledge formulae are shown to be be intractable, but efficient incremental algorithms are developed for formulae containing only knowledge operators. Connections to knowledge updates and compilation of knowledge based protocols are discussed.