AI1 - Schedule - Spring 2003

• Week 1: Chapter 1 (CI and Knowledge)
  • Agents in the World
  • Representation and Reasoning
  • Applications
  • Reading: Module 1 from CI
• Week 2-4 (to 01/27/03): Chapter 2 (A Representation and Reasoning System)
  • Datalog (Syntax & Semantics)
  • Reasoning with Datalog
  • Proofs
  • Function symbols
  • Reading: Module 2 and 3 from CI
  • Additional reading: Note on fist order logic. You can also read my first, second, and third class notes.
  • Slide for class on query answering .
• Week 4-5 : Chapter 3 (Using Definite Knowledge)
  • Reading: Chapter 3
  Module 3 from CI
  • My note for the chapter - part 1.

    FIRST MIDTERM - February 14, 2003

• Week 6 : Chapter 3 (Continue)
  • Reading: Chapter 3, especially sections 3.6 and 3.7 (not talk in class)
  • My notes for the chapter - part 2 and part 3.

• Week 7 : Chapter 4
  • Reading: Module 4 from CI
  The following questions can be considered as brainstorm questions.
  • What is the purpose of doing search?
  • What are the useful concepts in graph searching?
  • What are the different strategies in graph searching?
  • How can graph searching be used in problem solving?
  • What is heuristic search? What are the possible problems when heuristic search is used?
  • What is A* algorithm? What are the characeristics of A* algorithm?
  • What is a constraint satisfaction problem? General algorithms for solving a CSP?
  The codes from the chapter: General search and Delivery robot graph. Both have been adapted for use with Eclipse. If you want to use them in Sicstus Prolog, please uncomment the definitions of the predicates 'append', 'member', and 'writeln' (at the end of the files).
  • Here is my first note on search. You can also get the program search-1.pl that contains the code listed in the node.

• Week 8-9 : Chapter 4
  • Reading: Module 5 and Module 6 from CI.
  Some brainstorm questions:
  • What are the main issues in search?
  • Why do the issues arise?
  • What would you take into consideration when selecting a search strategy?
  • Why does iterative deepening require only linear space?
  • What is A* algorithm? What are the characeristics of A* algorithm?
  • What is a constraint satisfaction problem? General algorithms for solving a CSP?
  • What are the main ideas of dynamic programming?
  • Here is my second note on search (last updated: 03/13).
  • This is the slides for the scheduling example.

• Week 10 : Review (Monday, March 17) and Second Exam (Friday, March 21)
  • Review: (Part of) the solutions to some exercises is here: Exercise 3.10, Exercise 3.12, and Exercise 3.15.
  • Here is the code for generating all possible variable assignments Generate

• Week 11 : Chapter 5
  • Reading: Module 7 from CI.
  Some brainstorm questions (most are from the first two slides):
  • What is a solution to a problem?
  • What do you need in the language to represent the problem?
  • How can you map from the informal problem description to a representation of the problem?
  • What distinctions in the world are important to solve the problem?
  • What knowledge is required?
  • What level of detail is required?
  • What reasoning strategies are appropriate?
  • Is worst- case performance or average- case performance the critical time to minimize?
  • Is it important for a human to understand how the answer was derived?
  • How can you acquire the knowledge from experts or from experience?
  • How can the knowledge be debugged, maintained, and improved?
  • What is a RRS?
  • What are the characteristics of a RRS?
  • Homework: Exercises 5.1 and 5.2
  • Here is my note for the chapter.

• Week 12 : Chapter 7
  • Reading: Chapter 7, section 7.1 - 7.5 (7.3 is optional) Some brainstorm questions:
    • Why Closed World Assumption (CWA)?
    • What is negation as failure?
    • Describe some problems we might have when using negation as failure?
    • What is Clark's completion? How to compute it?
    • Why disjunctive and negative knowledge?
    • What is an answer set of a disjunctive logic program?
  • Homework: Exercises 7.3 and 7.4
  • Here is my note for the chapter (last update: April 14).

• Week 13 : Chapter 7 and 8
  • Reading: Note for chapter 7 and Chapter 8.

• Week 14 : Chapter 7 and 8
  • Reading: Note on first order logic (last updated April 24) and Chapter 8.

• Week 15 : Chapter 8
  • Reading: Note on situation calculus .