 | Gelfond M. Knowledge representation, reasoning, and the design of intelligent agents: the answer-set programming approach / M.Gelfond, Y.Kahl. - New York: Cambridge univ. press, 2014. - xiv, 348 p.: ill. - ISBN 978-1-107-02956-9
|
Preface ....................................................... xi
1 Logic-Based Approach to Agent Design ........................ 1
1.1 Modeling an Intelligent Agent .......................... 1
1.2 Simple Family Knowledge Base - An Example .............. 4
1.3 A Historical Comment ................................... 6
Summary ..................................................... 8
References and Further Reading .............................. 9
Exercises .................................................. 10
2 Answer Set Prolog (ASP) .................................... 11
2.1 Syntax ................................................ 11
2.2 Semantics ............................................. 16
2.3 A Note on Translation from Natural Language ........... 30
2.4 Properties of ASP Programs ............................ 31
Summary .................................................... 35
References and Further Reading ............................. 35
Exercises .................................................. 36
3 Roots of Answer Set Prolog ................................. 40
3.1 First-Order Logic (FOL) ............................... 40
3.2 Nonmonotonic Logics ................................... 43
3.3 ASP and Negation in Logic Programming ................. 49
Summary .................................................... 57
References and Further Reading ............................. 57
Exercises .................................................. 58
4 Creating a Knowledge Base .................................. 61
4.1 Reasoning about Family ................................ 62
4.2 Reasoning about Electrical Circuits ................... 71
4.3 Hierarchical Information and Inheritance ............... 75
Summary .................................................... 81
References and Further Reading ............................. 82
Exercises .................................................. 83
5 Representing Defaults ...................................... 86
5.1 A General Strategy for Representing Defaults .......... 86
5.2 Knowledge Bases with Null Values ...................... 93
5.3 Simple Priorities between Defaults .................... 95
5.4 Inheritance Hierarchies with Defaults ................. 99
5.5 (*) Indirect Exceptions to Defaults .................. 103
Summary ................................................... 108
References and Further Reading ............................ 108
Exercises ................................................. 109
6 The Answer-Set Programming Paradigm ....................... 114
6.1 Computing Hamiltonian Cycles ......................... 115
6.2 Solving Puzzles ...................................... 121
Summary ................................................... 127
References and Further Reading ............................ 128
Exercises ................................................. 129
7 Algorithms for Computing Answer Sets ...................... 131
7.1 Finding Models of Propositional Formulas ............. 131
7.2 Finding Answer Sets of Logic Programs ................ 136
Summary ................................................... 149
References and Further Reading ............................ 150
Exercises ................................................. 150
8 Modeling Dynamic Domains .................................. 152
8.1 The Blocks World-A Historic Example .................. 152
8.2 A General Solution ................................... 162
8.3   Syntax ............................................ 166
8.4 Semantics - The Transition Relation ............... 167
8.5 Examples ............................................. 175
8.6 Nondeterminism in ................................. 184
8.7 Temporal Projection .................................. 186
Summary ................................................... 187
References and Further Reading ............................ 188
Exercises ................................................. 189
9 Planning Agents ........................................... 192
9.1 Classical Planning with a Given Horizon .............. 192
9.2 Examples of Classical Planning ....................... 195
9.3 Heuristics ........................................... 204
9.4 Concurrent Planning .................................. 208
9.5 (*) Finding Minimal Plans ............................ 209
Summary ................................................... 211
References and Further Reading ............................ 213
Exercises ................................................. 214
10 Diagnostic Agents ......................................... 216
10.1 Recording the History of a Domain .................... 218
10.2 Defining Explanations ................................ 220
10.3 Computing Explanations ............................... 224
10.4 (*) Finding Minimal Explanations ..................... 228
10.5 Importance of New Predicates hpd and obs ............. 229
Summary ................................................... 231
References and Further Reading ............................ 232
Exercises ................................................. 232
11 Probabilistic Reasoning ................................... 235
11.1 Classical Probabilistic Models ....................... 235
11.2 The Jungle Story in P-log ............................ 238
11.3 Syntax and Semantics of P-log ........................ 241
11.4 Representing Knowledge in P-log ...................... 251
11.5 (*) P-log + CR-Prolog and the Wandering Robot ........ 263
Summary ................................................... 266
References and Further Reading ............................ 267
Exercises ................................................. 267
12 The Prolog Programming Language ........................... 271
12.1 The Prolog Interpreter ............................... 271
12.2 Programming in Prolog ................................ 284
Summary ................................................... 304
References and Further Reading ............................ 305
Exercises ................................................. 305
Appendix A: ASP Solver Quick-Start ........................... 307
Appendix В: Aspide ........................................... 310
Appendix С: Introduction to SPARC ............................ 314
Appendix D: Code ............................................. 317
D.l ASP Encoding of the Igniting the Burner Example ...... 317
D.2 ASP Encoding of the Missionaries and Cannibals
Example .............................................. 320
D.3 ASP Encoding of the Circuit Diagnostic Example ....... 325
Bibliography ................................................. 331
Index ........................................................ 343
|
|
