CS 244/444 Calendar, Readings, & Assignments

Please note that the topics and dates below are subject to change as the semester progresses.

Final Exam Study Guide

Textbook:

R&N = Artificial Intelligence: A Modern Approach, 2nd Ed. Stuart Russell & Peter Norvig, Pearson Education, 2003.

Papers:

Resources:

Date Topic Assignment Links
Sept 2 Syllabus; Propositional logic: semantics

Read: R&N Ch 7.0-7.4
Exercise: 7.2, due Sept 4

09.02 Lesson Plan
Sept 4 Proof systems Read: R&N Ch 7.5 up through page 216
Exercise: 7.4, due Sept 9
09.04 Lesson Plan
Sept 9 Representing problems using propositional schemas Exercise: Encoding cryptarithmetic puzzles. Due Sept 11. 09.09 Lesson Plan
Sept 11 Model finding by local search

Exercise: Encoding cyptarithmetic puzzles, continued. Due Sept 16.

Read: R&N Ch 7.6, and paper by Gomes at al, through section 2.3

09.11 Lesson Plan
Sept 16 Making local search robust Continue with readings. 09.16 Lesson Plan
Sept 18 Conversion to CNF; the DPLL algorithm; clause learning

Reading: R&N 7.6
R&N: Ch 11.1-11.2, 11.4-11.5
Paper by Kautz & Selman 1999

Programming project: Conversion to CNF

09.18 Lession Plan

Additional slides on DPLL, Walksat, and logic

Sept 23 (Instructor out of town; TA teaches) LISP Programming  
Sept 25 (Instructor out of town; TA teaches) LISP Programming  
Sept 30 Planning as satisfiability; Restart strategies Reading: paper by A. Gerevini and L.K. Schubert 09.30 Slides: Satplan
Oct 2 Class cancelled    
Oct 7 Clause learning; symmetry breaking Conversion to CNF assignment due.
Read: R&N Chapter 8 (all).
Exercise: R&N 8.2, 8.3, 8.4, to be turned in Oct 14. In addition: first draft of Citizenship Knowledge Engineering Exercise due on Oct 14.
10.07 Slides: Clause learning
Oct 9 NO CLASS    
Oct 14 First-order logic First draft of Citizenship Knowledge Engineering Exercise due. 10.15 Lesson Plan
Oct 16  

Final version of Citizenship Knowledge Engineering Exercise due on Oct 14.

For Oct 23: Read R&N Ch 9 through section 9.4.

Midterm Study Guide

10.17 Lesson Plan

Oct 21 MIDTERM    
Oct 23 Introduction to logic programming

For Oct 28: read R&N Ch 22 through 22.6. You can skip the subsection "Efficient Parsing" (pages 800-805).

Review these slides on parsing with Prolog (from a previous class, ignore comments about assignments, etc.).

 

10 23 Lesson Plan
Oct 28 Review of midterm Prolog Warm Up: Due Thursday Oct 30 (bring to class, not to be graded)  
Oct 30 Parsing natural language with Prolog

Using Prolog to Interpret English Sentences: Due Nov 11

For Nov 4: read R&N Ch 9.5

 
Nov 4 NO CLASS

 

 
Nov 6 Parsing, continued; FOL resolution theorem proving

Download and experiment with Prover9.

Read Wikipedia articles:

11 06 Lesson Plan
Nov 11 FOL resolution continued; Parsing with Prolog due! 11 11 Lesson Plan
Nov 13 Gödel's incompleteness theorem; Reasoning with default information

Exercise: Theorem Proving, due Nov 18.

11 13 Lesson Plan
Nov 18 Default and diagnostic reasoning

Read: handout, Ch 11 & Ch. 13 from Knowledge Representation & Reasoning by Brachman & Levesque

Read: R&N Ch 10.7

11 18 Lesson Plan
Nov 20 Default and diagnostic reasoning, continued

Exercise: Default & Diagnostic Reasoning , due Nov 25

11 20 Lesson Plan
Nov 25 The Semantic Web Read the Overview sections of this online book: A Semantic Web Primer, by Grigoris Antoniou and Frank Van Harmelen

Slides from A Semantic Web Primer, by Grigoris Antoniou and Frank Van Harmelen (note: many slides are "hidden" in slideshow mode)

Nov 27 (Thanksgiving) NO CLASS    
Dec 2 The Semantic Web, continued Assignment: The Semantic Web, due Dec 9  
Dec 4 Modal logic   12 04 Lesson Plan
Dec 9 Modal logic, continued    
Dec 11 Course summary Final Exam Study Guide