SYCS 660 Introduction to AI Fall '99.
Text: Artificial Intelligence: A Modern Approach
by Russell and Norvig

Reading and Homework Assignments

August 30, 1999

Lecture 1
Topics: Course Requirements, Course Description, and Historical Background.
Read: Chapter 1

Homework:

September 6, 1999

Lecture 2
Topics: Continue Historical Background; Introduction to Intelligent Agents;

Read: Chapter 1 and Chapter 2
Homework: Define five agents in terms of their PAGE characteristics.

September 13, 1999

Lecture 3
Topics: Types of agents; State Space Problem, problem solving
Read: Chapter 2, Chapter 3, pages 55-73
Homework: Begin the NIM agent program.

September 20, 1999

Lecture 4
Topics:; Solving Problems by Searching
Read: Chapter 3, pages 73-87
Homework: implement a knowledge base for the tic tac toe game

September 27, 1999

Lecture 5
Topics: Uninformed Searches: Depth Limited, Iterative Deepening; Constraint Satisfaction

Read:, Chapter 3, pages 73-87
Homework: Implement a depth-first search and breath-first search on a knowledge base for the tic tac toe game

October 4, 1999

Lecture 6
Topics: Informed Search Methods
Read: Chapter 4, pp. 92-106

Homework: Complete previous assignment

October 11, 1999

Lecture 7
Topics: Game Playing; Minimax Search; Alpha-Beta Search
Read: Chapters 5
Homework: Complete the traveling salesman example using the branch and bound method

October 18, 1999

Lecture 8
Topics: Describe Dynamic Programming; Problem Reduction; and Tower of Hanoi Representations
Read: Chapter 5

October 25, 1999

Lecture 9
Read: Chapters 1, 2, 3, 4 and 5

MidTerm Exam: Chapters 1, 2, 3, 4 and 5

November 1, 1999

Lecture 10
Topics: Minimax Search; Alpha-Beta Search; Review Propositional Calculus
Read: Chapter 6
Term Projects: Provide Proposals for Term Projects

November 8, 1999

Lecture 11
Topics: Review Predicate Logic, Disjunctive and Conjunctive Normal Forms, Prenex Normal Form
Read: Russel and Norvig , Chapter 7, 185-201; Korfhage, Chapters 3, 6; Chang and Lee, Chapters 1, 2, and 3
Homework: Mid-Term Date: March 28

November 15, 1999

Lecture 12
Topics: Language of Davis and Putnam, Clause Form, Herbrand Universe
Read: Russell and Norvig, Chapter 9, 265-272
Homework: Problems distributed in class section 2.1-1, section 2.2-3, section 2.4-6,7, section 2.5-10, section 3.1-1,3,9

November 22, 1999

Lecture 13
Topics: Herbrand Base, Unsatisfiability and Herbrand Universe, Binary Semantic Tree, Failure Node, Herbrand Theorem
Read:
Homework:

November 29, 1999

Lecture 14
Topics: Konig's Lemma
Read:
Homework:

SYCS 660 Introduction to AI Fall '99. Text: Artificial Intelligence: A Modern Approach by Russell and Norvig