Differences

This shows you the differences between two versions of the page.

--- course_outline [2013/01/30 02:25] – bita
+++ course_outline [2013/04/04 13:33] (current) – bita
@@ Line 13: / Line 13: @@
 ^ Date      ^ Reading      ^ Slides       ^ Resources  ^
 | January 7 | (R&N) Chapter 1 and 2 | {{:week1.pdf|Introduction to AI and Intelligent Agents}} | - |
-| January 9 & 14 | (C&M) Ch 1, 2, 3.1-3.3, 8 | {{:slides02.pdf|Prolog Core Concepts and Notation}}|{{:zebra.txt|zebra.txt}},{{:family.txt|family.txt}},{{:swiprologgettingstarted.pdf|SWI-Prolog Getting Started}},{{:exerciseset1.pdf|Exercise Set 1}} |
+| January 9 & 14 | (C&M) Chapter 1, 2, 3.1-3.3, 8 | {{:slides02.pdf|Prolog Core Concepts and Notation}}|{{:zebra.txt|zebra.txt}},{{:family.txt|family.txt}},{{:swiprologgettingstarted.pdf|SWI-Prolog Getting Started}},{{:exerciseset1.pdf|Exercise Set 1}} |
 | January 16 & 21 | (R&N) Chapter 8 (Chapter 7 is optional) | {{:slide03.pdf|Knowledge Representation & First-Order Logic}} | - |
 | January 23 & 28 | (R&N) Chapter 9 (9.1, 9.2, 9.5) | {{:slide04.pdf|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 | {{:publickrslidesch5-6.pdf|Reasoning with Horn Theories and Procedural Control of Reasoning }} | - |
+| February 6 & 11 | (C&M) Chapter 3, 4, 5 (5.1, 5.5) and 6  | {{:slides05.pdf|Prolog control flow, Negation as failure, Cut, 2nd order features and Tail recursion }} | - |
+| February 11 & 13 | (C&M) Chapter 7 and 9 | {{:slide06.pdf|Prolog programming techniques, recursion, divide and conquer, text proessing}} | - |
+| February 27 & March 4 | (R&N) Chapter 3 (3.1-3.4) | {{:slide07.pdf|Uninformed Search I}} | - |
+| March 4 & March 6 | (R&N) Chapter 3 (3.1-3.4) | {{:slide08.pdf|Uninformed Search II}} | - |
+| March 11 & March 13 | (R&N) Chapter 3 (3.5-3.6) and 4 (4.1) | {{:slides09.pdf|Informed Search}} | - |
+| March 18 & March 20 | (R&N) Chapter 5 (5.1-5.3 and 5.7) | {{:slide10.pdf|Game Tree Search}} | - |
+| March 25 & March 27 | (R&N) Chapter 6 | {{:slide11.pdf|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 | {{:BLch12-2pp.pdf|Reasoning under Uncertainty}} | - |
+| April 3 | - | {{:introfpandlisp.pdf|Introduction to Functional Programming and LISP}} | Rename to lp.lsp {{:lp.txt|lp.txt}} |