Preface |
|
xi | |
|
Introduction and Overview |
|
|
1 | (14) |
|
The Muddy Children Puzzle |
|
|
3 | (4) |
|
|
7 | (8) |
|
|
15 | (32) |
|
The Possible-Worlds Model |
|
|
15 | (8) |
|
Common Knowledge and Distributed Knowledge |
|
|
23 | (1) |
|
The Muddy Children Revisited |
|
|
24 | (6) |
|
The Properties of Knowledge |
|
|
30 | (6) |
|
|
36 | (11) |
|
Completeness and Complexity |
|
|
47 | (56) |
|
|
48 | (14) |
|
|
62 | (4) |
|
Incorporating Common Knowledge |
|
|
66 | (3) |
|
Incorporating Distributed Knowledge |
|
|
69 | (2) |
|
The Complexity of the Validity Problem |
|
|
71 | (3) |
|
NP-Completeness Results for S5 and KD45 |
|
|
74 | (2) |
|
The First-Order Logic of Knowledge |
|
|
76 | (27) |
|
|
77 | (3) |
|
|
80 | (1) |
|
|
81 | (2) |
|
Properties of Knowledge in Relational Kripke Structures |
|
|
83 | (20) |
|
Knowledge in Multi-Agent Systems |
|
|
103 | (50) |
|
|
103 | (7) |
|
|
110 | (4) |
|
|
114 | (2) |
|
|
116 | (20) |
|
|
116 | (7) |
|
|
123 | (4) |
|
|
127 | (1) |
|
|
128 | (3) |
|
|
131 | (2) |
|
Asynchronous Message-Passing Systems |
|
|
133 | (3) |
|
Knowledge Gain in A.M.P. Systems |
|
|
136 | (17) |
|
|
153 | (22) |
|
|
153 | (4) |
|
|
157 | (11) |
|
|
168 | (2) |
|
|
170 | (5) |
|
Common Knowledge and Agreement |
|
|
175 | (58) |
|
|
176 | (8) |
|
|
184 | (6) |
|
Simultaneous Byzantine Agreement |
|
|
190 | (7) |
|
Nonrigid Sets and Common Knowledge |
|
|
197 | (4) |
|
|
201 | (6) |
|
Attaining Common Knowledge |
|
|
207 | (7) |
|
|
207 | (2) |
|
|
209 | (3) |
|
Computing Common Knowledge |
|
|
212 | (2) |
|
|
214 | (19) |
|
Knowledge-Based Programming |
|
|
233 | (48) |
|
|
233 | (6) |
|
Getting Unique Representations |
|
|
239 | (12) |
|
Knowledge Bases Revisited |
|
|
251 | (4) |
|
A Knowledge-Based Program for SBA |
|
|
255 | (4) |
|
|
259 | (3) |
|
The Sequence-Transmission Problem |
|
|
262 | (7) |
|
Proving Strong Correctness of ST |
|
|
269 | (12) |
|
|
281 | (28) |
|
Properties of Knowledge and Time |
|
|
281 | (4) |
|
Synchrony and Perfect Recall |
|
|
285 | (4) |
|
Knowledge and Time in A.M.P. Systems |
|
|
289 | (1) |
|
Knowledge and Time in Inoa (&PHgr;) |
|
|
290 | (5) |
|
A Closer Look at Axiom OAn, &PHgr; |
|
|
295 | (14) |
|
|
309 | (54) |
|
|
310 | (3) |
|
Explicit Representation of Knowledge |
|
|
313 | (8) |
|
|
314 | (2) |
|
|
316 | (4) |
|
|
320 | (1) |
|
|
321 | (11) |
|
|
321 | (4) |
|
|
325 | (4) |
|
A Payoff: Querying Knowledge Bases |
|
|
329 | (2) |
|
|
331 | (1) |
|
|
332 | (5) |
|
|
337 | (5) |
|
|
342 | (5) |
|
|
347 | (16) |
|
Knowledge and Computation |
|
|
363 | (22) |
|
Knowledge and Action Revisited |
|
|
363 | (3) |
|
|
366 | (5) |
|
|
366 | (4) |
|
Properties of Algorithmic Knowledge |
|
|
370 | (1) |
|
|
371 | (3) |
|
|
374 | (11) |
|
|
374 | (2) |
|
Algorithmic Knowledge and Complexity |
|
|
376 | (2) |
|
Implementing Knowledge-Based Programs |
|
|
378 | (7) |
|
Common Knowledge Revisited |
|
|
385 | (44) |
|
Common Knowledge as a Conjunction |
|
|
386 | (2) |
|
Common Knowledge and Simultaneity |
|
|
388 | (7) |
|
Common Knowledge and Uncertainty |
|
|
388 | (3) |
|
|
391 | (4) |
|
|
395 | (2) |
|
|
397 | (5) |
|
Common Knowledge as a Fixed Point |
|
|
402 | (9) |
|
|
402 | (7) |
|
Downward Continuity and Infinite Conjunctions |
|
|
409 | (2) |
|
Approximations of Common Knowledge |
|
|
411 | (10) |
|
E- and Eventual Common Knowledge |
|
|
412 | (3) |
|
Applications to Coordinated Attack |
|
|
415 | (3) |
|
Timestamped Common Knowledge |
|
|
418 | (3) |
|
Other Approximations of Common Knowledge |
|
|
421 | (1) |
|
|
421 | (8) |
Bibliography |
|
429 | (20) |
Index |
|
449 | (26) |
Symbol Index |
|
475 | |