Old Web Page for
CPSC 420-502 Artificial Intelligence:
Fall 2003

Syllabus

NEWS: 12/17/03, 01:48AM (Wed)
  • [12/17] Final letter grades (tentative) are available.
  • For questions about grade, send me email choe(a)tamu.edu.
  • Grades will be turned in by Friday 10am.
  • Ask the TA for homework 3 details.
  • Ask the instructor for paper review 2 details.
  • You may come by and pick up your assignments.
Read-Only Bulletin Board.: 11/12/03, 06:02PM (Wed)

Page last modified: 11/25/03, 01:54AM Tuesday.

General Information Resources Weekly Schedule Credits Lecture Notes

I. General Information

Instructor:

Dr. Yoonsuck Choe
Email: choe(a)tamu.edu
Office: HRBB 322B
Phone: 845-5466
Office hours: T/TR 11:00pm-12:30pm. Other times: by appointment.

TA:

Subramonia P. Sarma
Email: sps8556(a)cs.tamu.edu
Office: HRBB 322A
Phone: 845-5481
Office hours: M/W 2:30pm-4:00pm

Prerequisite/Restrictions:

CPSC 311

Lectures:

T/TR 9:35am-10:50am, ZACH 105B

Goals:

To understand the problems in AI and to learn how to solve them:
  1. traditional AI techniques (search, pattern matching, logical inference, theorem proving, etc.).
  2. modern approaches in AI (learning, probabilistic approaches, etc.).

Textbook:

Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach (AIMA, hereafter), 2nd Edition, Prentice Hall, New Jersey, 2003.
ISBN 0-13-790395-2
Book Homepage

Computer Accounts and Usage:

  1. Computer accounts: if you do not have a unix account, ask for one on the CS web page. We will be using the CMU Common Lisp as our main language. You can choose your own language to use for the assignments, but you have to first get permission from the instructor.
  2. CMU Common Lisp:

Topics to be covered:

See the Weekly Schedule section for more details.
  1. Introduction : 1 week
  2. LISP : 1 week
  3. Search : 1.5 weeks
  4. Game Playing : 0.75 week
  5. Propositional Logic, First-order logic: 3.5 weeks
  6. Uncertainty : 1 weeks
  7. Learning : 2.5 weeks
  8. Special Topics : 1 week

Grading:

  1. Exams: 45% (midterm: 20%, final: 25%)
  2. Homeworks (about 3): 15%
  3. Programming Assignments (about 3 2): 36% 24%
  4. Paper comments (about 1 2): 4% 16%
Grading will be on the absolute scale. The cutoff for an `A' will be at most 90% of total score, 80% for a `B', 70% for a `C', and 60% for a `D'. However, these cutoffs might be lowered at the end of the semester to accomodate the actual distribution of grades.

Academic Dishonesty:

The TAMU student rules (http://student-rules.tamu.edu/), Part I Rule 20 will be strictly enforced. To quote from the page, the following are unacceptable. See the same page for your rights. Local Course Policy:

II. Resources

  1. LISP quick reference
  2. CMU Common Lisp (This one will be used in the class.)
  3. GCL manual (very in-depth and technical).
  4. GNU Common Lisp
  5. Lisp resources
  6. My general resources page
  7. 420 Reading List

III. Weekly Schedule and Class Notes

Week
Date
Topic
Reading
Assignments
Notices and Dues
Notes
1 9/2 Introduction Chapter 1
1.1 and 1.2
  First day of class slide01.pdf
1 9/4 Introduction Chapter 26
26.1 and 26.2
  Unix basics (DIY) slide01.pdf
2 9/9 Lisp Lisp quick ref     slide02.pdf
2 9/11 Lisp (Symbolic Diff)   Prog. Asmt. #1 (see slide02)   slide02.pdf
3 9/16 Uninformed Search
(BFS,DFS,DLS,IDS)
Chapter 3.1-3.5
(3.6,3.7 optional)
    slide03.pdf
3 9/18 Informed
Search (BFS,Greedy,A*)
Chapter 4.1-4.3 (4.4 optional)
(old 4.1-4.3)
    slide03.pdf
slide04.pdf
4 9/23 IDA*,Heuristic Search,
Simulated Annealing, etc.
Chapter 4     slide04.pdf
slide05.pdf
4 9/25 Game playing
Min-Max, Alpha-Beta
Chapter 5 (optional) and 6.1-6.8 (old 5) HW Asmt. #1
Prog. Asmt. #2 (see slide06)
Prog. Asmt. #1 due slide03.pdf
slide06.pdf
5 9/30 Game playing wrap up
Propositional Logic
Chapter 7.1, 7.3, 7.5, 7.6 (old 6)     slide06.pdf
slide07.pdf
5 10/2 Theorem proving Chapter 9 (old 10)   HW Asmt. #1 due slide07.pdf
6 10/7 First-order logic Chapter 8 (old 7) HW Asmt. #2 HW #1
Solution
slide07.pdf
slide08.pdf
6 10/9       slide08.pdf
7 10/14 Inference
for FOL
Chapter 9   HW Asmt. #2 due
Midterm Review
HW #2 Solution
slide08.pdf
7 10/16 Midterm Exam old midterm and solution In class exam.  
8 10/21 Theorem proving
for FOL
Chapter 9 (old 10)   10/20 (mid-semester
grades due)
slide08.pdf
8 10/23       slide08.pdf
9 10/28 Uncertainty Chapter 13 (old 14)     slide09.pdf
9 10/30       slide09.pdf
10 11/4 Probabilistic
reasoning
Chapter 14 (old 15)   Prog. Asmt. #2 due slide09.pdf
10 11/6   11/7 (Q-drop) Prog. Asmt. #2 due
(with -5pt penalty)
slide09.pdf
11 11/11 Learning Chapter 18 Prog. Asmt. #3 Prog. Asmt. #2 due
(with -10pt penalty)
slide10.pdf
11 11/13   Paper Review
Instructions (pdf)
  slide10.pdf
12 11/18 Learning (Nnets) Chapter 20 (old 19)     slide10.pdf
12 11/20     Prog. Asmt. #3 due slide10.pdf
13 11/25 Learning (Nnets) Chapter 20 (old 19) HW Asmt. #3 Paper review #1 due slide10.pdf
13 11/27 Thanksgiving Holiday No class    
14 12/2 Learning (wrap up)       slide10.pdf
14 12/4 Special topics Choe & Bhamidipati (2003)   Peper review #1
will be returned
 
15 12/9 Special topics Choe (2002)   Last day of class.
Final exam review
(Wed 12/10 6pm)
HRBB 320
HW Asmt #3 due
HW #3 Solution
 
 12/12FinalExam 12:30-2:30pm
Paper review #2 due
 

IV. Credits

Many ideas and example codes were borrowed from Gordon Novak's AI Course and Risto Miikkulainen's AI Course at the University of Texas at Austin (Course number CS381K).

$Id: index.php,v 1.4.1.7 2003/11/13 00:02:12 choe Exp choe $