course_outline
Course Outline
The course outline is a guideline to topics that will be discussed in the course, and when they will be discussed:
Course Outline
| Date | Reading | Slides | Resources |
|---|---|---|---|
| January 7 | (R&N) Chapter 1 and 2 | Introduction to AI and Intelligent Agents | - |
| January 9 & 14 | (C&M) Chapter 1, 2, 3.1-3.3, 8 | Prolog Core Concepts and Notation | zebra.txt,family.txt,SWI-Prolog Getting Started,Exercise Set 1 |
| January 16 & 21 | (R&N) Chapter 8 (Chapter 7 is optional) | Knowledge Representation & First-Order Logic | - |
| January 23 & 28 | (R&N) Chapter 9 (9.1, 9.2, 9.5) | Inference in First-Order Logic | - |
| January 30 & February 4 | (R&N) Chapter 9 and (C&M) Chapter 4 and 10 - Optional Readings: Brachman and Levesque, Knowledge Representation and Reasoning, Chapters 5 & 6 | Reasoning with Horn Theories and Procedural Control of Reasoning | - |
| February 6 & 11 | (C&M) Chapter 3, 4, 5 (5.1, 5.5) and 6 | Prolog control flow, Negation as failure, Cut, 2nd order features and Tail recursion | - |
| February 11 & 13 | (C&M) Chapter 7 and 9 | Prolog programming techniques, recursion, divide and conquer, text proessing | - |
| February 27 & March 4 | (R&N) Chapter 3 (3.1-3.4) | Uninformed Search I | - |
| March 4 & March 6 | (R&N) Chapter 3 (3.1-3.4) | Uninformed Search II | - |
| March 11 & March 13 | (R&N) Chapter 3 (3.5-3.6) and 4 (4.1) | Informed Search | - |
| March 18 & March 20 | (R&N) Chapter 5 (5.1-5.3 and 5.7) | Game Tree Search | - |
| March 25 & March 27 | (R&N) Chapter 6 | CSPs & Backtracking Search | - |
| April 1 | (R&N) Chapter 13 and Chapter 14 Sec. 1 and 2 - Optional Readings: Brachman and Levesque, Knowledge Representation and Reasoning, Chapter 12 | Reasoning under Uncertainty | - |
| April 3 | - | Introduction to Functional Programming and LISP | Rename to lp.lsp lp.txt |
course_outline.txt · Last modified: 2013/04/04 13:33 by bita