Главная    Ex Libris    Книги    Журналы    Статьи    Серии    Каталог    Wanted    Загрузка    ХудЛит    Справка    Поиск по индексам    Поиск    Форум   
blank
Авторизация

       
blank
Поиск по указателям

blank
blank
blank
Красота
blank
Meyer J.-J.Ch. — Epistemic Logic for AI and Computer Science (Cambridge Tracts in Theoretical Computer Science)
Meyer J.-J.Ch. — Epistemic Logic for AI and Computer Science (Cambridge Tracts in Theoretical Computer Science)



Обсудите книгу на научном форуме



Нашли опечатку?
Выделите ее мышкой и нажмите Ctrl+Enter


Название: Epistemic Logic for AI and Computer Science (Cambridge Tracts in Theoretical Computer Science)

Автор: Meyer J.-J.Ch.

Аннотация:

Epistemic 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.


Язык: en

Рубрика: Computer science/

Статус предметного указателя: Готов указатель без номеров страниц

ed2k: ed2k stats

Год издания: 2004

Количество страниц: 368

Добавлена в каталог: 15.08.2020

Операции: Положить на полку | Скопировать ссылку для форума | Скопировать ID
blank
Предметный указатель
$S5P^{+}$-structures      177
$S5_{(1)}$-models      28—38
Action accordant      99
Action informative      101
AE-extension      145
AE-interpretation      143
AE-model      143
AE-satisfiable      143
AE-valid      143
AE-valid with respect to index      143
AE-valuation      143
AEL      see "Autoepistemic logic"
Alternating bit protocol      40 44
Autoepistemic (or AE-)formulas      142
Autoepistemic implication      143
Autoepistemic logic      114 133 141 159
awareness      77
Awareness general      79
Awareness resource bounded      79
Awareness special      79
Barcan Formula      228
Belief      1 68
Belief explicit      74
Belief implicit      74
Belief revision      132
Belief strong      80
Belief weak      80
Belief-as-possibility      73
Bisimulation      30
Brewka      191
Cascaded ambiguity      173
Cautious monotonicity      137 191
Closed world assumption      132 160 163 170 188
Cluster model      79
Common belief      89
Common knowledge      45—65 89
Common-sense knowledge      5
Common-sense reasoning      5
Complementary structure      153
Completeness      17—22
Completeness of $KD(45)_{m}$      70
Completeness of $KEC_{(m)}$, $TEC_{(m)}$, $S4EC_{(m)}$, and $S5EC_{(m)}$      47 56
Completeness of $KI_{(m)}$, $TI_{(m)}$, $S4I_{(m)}$, $S5I_{(m)}$      67
Completeness of first-order К, T, S4 and S5      228
Completeness of T, S4, S5      27
conditional logic      196 205
Consistent      14
Contradicting justifications      170
Contraposition      168
Correspondence theory      25
Counterfactual reasoning      130 195—208
Counterfactuals      195
Cumulativity      141 190
Cut      137 191
CWA      see "Closed world assumption"
Deduction model of belief      211
Deduction system      212
Default entailment      188
Default logic      161 193
Default reasoning      159—195
Default theory      187
Defaults non-normal      169
Defaults normal      166
Defeasible reasoning      129
Depth of a formula      220
Derivation      13
Disjunctive information      131 169
Distributed knowledge      65
Distributed processes      39
distributed systems      38 59
Dynamic epistemic logic      177
EDL-formulas      164
Epistemic alternatives      8
Epistemic formula      190
Epistemic formulas      7
Epistemic logic      xi
Epistemic logic, first-order      225
Epistemic state      139 114
Epistemic state, entailment based on      126 140
Equivalence relation      25
Euclidicity      25
Extensions in the sense of Reiter      161
Fagin      xi 68 77 218
Filtrations      51
First-order      227
First-order Kripke model      227
Frame assumption      161
Frame problem      176 200
Fusion models      84
Gaerdenfors      132 205
Ginsberg      204
Grounded sets      147
Halpern      xi 38 40 77 114 139 218
Hanks      179
Hidden presumptions      175
Hiding Turkey Scenario      183
Hintikka      xi
Honest formula      118 122 123 140
Ignorance      113
Implicit belief      83
Intersection, modal characterisation of      66
Jaspars      84
Knowing only      154
Knowledge      1
Knowledge and action      96
Knowledge and belief      89
Knowledge assignment      218
Knowledge common      45
Knowledge implicit      65
Knowledge opaque      82
Knowledge structures      218
Konolige      157 211
Kraus      89 190
Kripke model      7
Kripke semantics      8
Kripke structure      7
Language external      211
Language internal      211
Law of inertia      176 200
Left logical equivalence      138 191
Lehmann      xi 89 190
Levesque      xi 74 114 154
Lewis      204
Local reasoning      79 111
Logical omniscience      71
Lottery Paradox      171
Magidor      190
Makinson      190
Maximally consistent      14
Maximally S-consistent      14
McCarthy      179
McDermott      133 179
Message logic      68
Modal logic      xi
Modalities graded      103
Monotonic logic      135
Moore      xi 114 133 141
Moses      xi 38 79 114 139
Muddy children puzzle      56 58
Necessitation      13 166
Nixon Diamond      173
Non-monotonic reasoning      129
Non-monotonicity      163 194 206
Non-monotonicity of counterfactual implication      204
Non-normal defaults      169
Normal defaults      166
Normal form      35
Numerical syllogisms      111
Observational equivalence      39
Partial semantics      88
Pennsylvania Dutch      175
Perfect X-reasoner      213
Point      38
Possible world      8 220
Practical belief operator      164
Preferential logic      133
Preferentially satisfiable      133
Preferentially valid      134
Preferred model      133
Principles      83
Protocol verification      39
Purely propositional formula      115
Rantala      87
Rational monotonicity      192
Reasoning by cases      172
Reduced $S5_{(1)}$-models      28
Reflexivity      25 138 191
Reiter      161
Right weakening      138 191
Royal elephants      175
Run      38 59
Run, non-simultaneous      62
S-(in)consistent      14
S-theorems      14
S5-reduction      165
S5AP-structures      198
S5P-extension      165
Sandewall      183
Satisfiability      222
Satisfiability, first-order      227
Semantically closed set      144
Semantically complete set      144
Semantically sound set      144
Sequence transmission-problem      40
Seriality      25
Shoham      133
Sieve semantics      88
Simple S5(1)-models      30
Simple S5-model      120
Soundness      17
Soundness of $KEC_{(m)}$, $TEC_{(m)}$, $S4EC_{(m)}$, and $S5EC_{(m)}$      47
Soundness of first-order К, T, S4 and S5      228
Soundness of KD45(in)      70
Soundness of T, S4, S5      26
Specificity      174
Stable set      115 145
State      8
Strengthening the antecedent      167
Subjective formula      155
Subjective formula, basic      155
Symmetry      25
System $K45_{(m)}$      69
System $KD45_{(m)}$      69 229
System $KEC_{(m)}$      46
System $KI_{(m)}$      66
System $K_{(m)}$      13 229
System $ML_{(m)}$      68
System $S4EC_{(m)}$      46
System $S4I_{(m)}$      66
System $S4_{(m)}$      23
System $S5EC_{(m)}$      46 229
System $S5I_{(m)}$      66 229
System $S5_{(1)}$      28
System $S5_{(m)}$      23 224 229
System $S5_{(m)}$, weak      69
System $TEC_{(m)}$      46
System $TI_{(m)}$      66
System $T_{(m)}$      23
System DEDL      177 180
System Dual-KD45      73
System Dual-S5      74
System ECL      231
System EDL      159 164 166 230
System first-order S4      228
System first-order S5      228 231
System first-order T      228
System first-order К      227 231
System Gr(S5)      104 230
System K45      165
System KL      92
System S5      165
System S5O      155 230
System К      216
Temporal logic      94
Thijsse      88
Time      94
Transitivity      25 167 207
Truth maintenance systems      132
Tweety      188
Universal S5-model      151
Validity      222
Vardi      xi 68 218
Vreeswijk      157
Weak deduction theorem      136
World      8
World, impossible      87
X-interpretation      143
Yale Shooting Problem      179
Zuck      40
blank
Реклама
blank
blank
HR
@Mail.ru
       © Электронная библиотека попечительского совета мехмата МГУ, 2004-2021
Электронная библиотека мехмата МГУ | Valid HTML 4.01! | Valid CSS! О проекте