CMSC 421: Introduction to AI - Fall 2009

Lectures and Assignments

These abbreviations are used in the following assignments:
Course Summary and Reading Assignments
 Date Lecture Topics Assigned Readings
9/1 Introduction to AI
(Lecture Slides)  
 
 
R&N:
    Ch. 1 (omit Sect. 1.2),
    Ch. 2 (omit Sect. 2.3),
    Ch. 26
9/3 Evaluating Symbolic Expressions (Lecture Slides)
Assignment 1 out
ACL: 1-24, 31-55, 195-199
 
 
9/8 Functional Programming ACL: 114-116, 143-150
9/10 Lisp Programming I
(Lecture Slides)
ACL: 133-138, 201-203, 208-211, 287-294
 
9/15 Lisp Programming II
(Lecture Slides)
Control Strategies
(Lecture Slides)
ACL: 81-92, 102-103, 119-125, 130-131
 
 
 
9/17 Mapping Functions
(Lecture Slides)
Lisp Macros
(Lecture Slides)
ACL: 25-27, 160-173
 
 
 
9/22 In-class Exercise
Associative Memory
(Lecture Slides)
General Problem Solving
(Lecture Slides)
 
ACL: 248-250, 295-303
 
 
 
9/24 State Space Search I
(Lecture Slides)
Assignment 2 Out
R&N: 59-83
 
 
9/29 Assignment 1.2 Review
State Space Search II
(Lecture Slides)
Quiz 1
 
R&N: 94-101, 105-110
 
 
10/1 Quiz 1 Review
Constraint Satisfaction Problems (Lecture Slides)
Assignment 3 Out
 
R&N: 137-147
 
 
10/6 Adversarial Search
(Lecture Slides)
Quiz 2
R&N: 161-171, 180-185
 
 
10/8 Review of Asg. 2
Alpha-Beta Search
(Lecture Slides)
Checkers is Solved
Problem Reduction
Hill Climbing Intro
 
 
 
 
 
R&N: 110-116
10/13 Asg. 3 Review
Quiz 2 Review
Hill Climbing (Lecture Slides)
 
 
R&N: 119-122, 150-151
10/15 MIDTERM EXAM     ---
10/20 Review Midterm Exam
Simulated Annealing
(Lecture Slides)
 
 
R&N: 115-116
10/22 Automated Reasoning
Propositional Resolution
R&N: 194-197, 200-207
R&N: 210-217
10/27 Propositional Resolution
In-class Exercise
FOPC and Unification
(Lecture Slides)
Assignment 4 Out
 
 
R&N: 245-256, 272-278
 
 
10/29 FOPC Resolution
In-class Exercise
Answer Extraction
(Lecture Slides)
Intro to Prolog
R&N: 295-300, 304-306
 
 
 
R&N: 287-290
11/3 Prolog (Lecture Slides)
Knowledge Engineering
Assignment 5 Out
Clocksin & Mellish, Prolog, 1984, 1-21
R&N: 217-220, 260-266, 280-283
 
11/5 Computer Vision (T. Huynh) R&N: 752-754, 869-873, 885-894
11/10 Asg. 4 Review
Knowledge Engineering
(Lecture Slides)
Rule-Based Expert Systems
 

 
 
Gonzalez, Engineering Knowledge Based Systems, 1993, 86-99
11/12 Rule-Based Systems (cont.)
(Lecture Slides)
Abductive Expert Systems
(Lecture Slides)
 
 
 
R&N: 320-324, 349-352
Peng, Abductive Inference Methods,
1990, 1-9, 20-24
11/17 Asg. 5 Review
Probability Theory Review
Bayesian Classifiers
(Lecture Slides)
Assignment 6 Out
 
 
R&N: 462-482
 
 
11/19 Bayesian Networks
(Lecture Slides)
 
R&N: 492-501, 504-506, 511-514
Peng, Abductive Inference Methods,
1990, 99-100, 113-115
11/24 Planning (Lecture Slides)
Assignment 7 Out
R&N: 375-393
 
11/26 Thanksgiving Holiday     ---
12/1 Asg. 6 Review
Natural Language Processing
(Lecture Slides)
Assignment 8 Out
 
R&N: 790-800, 818-824
Woods, Transition Network Grammars, CACM,
1970, 591-596 only
12/3 Machine Learning
(Lecture Slides)
R&N: 649-664
 
12/8 Asg. 7 Review (Slides)
Neural Networks
(Lecture Slides)
Class Evaluation
 
R&N: 736-746
 
 
12/10 Asg. 8 Review (Slides)
Neural Nets (concl.)
(Lecture Slides)
Genetic Algorithms
(Lecture Slides)
 
 
 
R&N: 116-119
 
12/17 FINAL EXAM, 10:30 AM     ---


Back to CMSC 421 Home Page