## Epistemic Logic for AI and Computer ScienceEpistemic logic has grown from its philosophical beginnings to find diverse applications in computer science as a means of reasoning about the knowledge and belief of agents. This book, based on courses taught at universities and summer schools, provides a broad introduction to the subject; many exercises are included together with their solutions. The authors begin by presenting the necessary apparatus from mathematics and logic, including Kripke semantics and the well-known modal logics K, T, S4 and S5. Then they turn to applications in the contexts of distributed systems and artificial intelligence: topics that are addressed include the notions of common knowledge, distributed knowledge, explicit and implicit belief, the interplays between knowledge and time, and knowledge and action, as well as a graded (or numerical) variant of the epistemic operators. The problem of logical omniscience is also discussed extensively. Halpern and Moses' theory of honest formulae is covered, and a digression is made into the realm of non-monotonic reasoning and preferential entailment. Moore's autoepistemic logic is discussed, together with Levesque's related logic of 'all I know'. Furthermore, it is shown how one can base default and counterfactual reasoning on epistemic logic. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

II | 1 |

III | 7 |

V | 8 |

VI | 13 |

VII | 23 |

VIII | 25 |

IX | 28 |

X | 35 |

XXXVIII | 104 |

XXXIX | 109 |

XL | 113 |

XLI | 114 |

XLII | 126 |

XLIII | 129 |

XLIV | 139 |

XLV | 141 |

XI | 38 |

XII | 39 |

XIII | 45 |

XV | 47 |

XVI | 51 |

XVII | 56 |

XVIII | 59 |

XIX | 64 |

XX | 65 |

XXI | 68 |

XXII | 71 |

XXIII | 73 |

XXIV | 74 |

XXV | 77 |

XXVI | 79 |

XXVII | 83 |

XXVIII | 84 |

XXIX | 87 |

XXX | 89 |

XXXI | 90 |

XXXII | 91 |

XXXIII | 92 |

XXXIV | 93 |

XXXV | 94 |

XXXVI | 96 |

XXXVII | 103 |

### Other editions - View all

Epistemic Logic for AI and Computer Science John-Jules Ch Meyer,Wiebe van der Hoek No preview available - 1995 |

### Common terms and phrases

accessibility action AE-extension agent alive already apply approach arbitrary assertion assume assumption axiom belief called Check closed cluster common complete conclude condition consequence consider consistent contains COROLLARY counterfactual default define definition denoted derive epistemic epistemic formulas epistemic logic equivalent example Exercise express extension fact finite fire formula frame Furthermore give given Halpern hence holds honest immediately implies induction instance interpretation knowledge known Kripke model language Lemma loaded logic maximal means modal Moreover non-monotonic normal Note notion observe obtain operator particular possible preferred problem PROOF properties propositional prove reasoning reflexive relation represent respect result rule satisfiable semantics simple situation sound stable set structure Suppose Theorem theory transitive true truth valid