|
|
|
General Information | Resources | Weekly Schedule | Credits | Lecture Notes |
I. General Information |
Dr. Yoonsuck Choe
Email: choe(a)tamu.edu
Office: HRBB 322B
Phone: 845-5466
Office hours: MWF 1:00-2:00pm
Yingwei Yu
Email: yingweiy(a)cs.tamu.edu
Office: HRBB 417 (note new room, effective 3/07/05)
Phone: 845-0269
Office hours: T/TH 10:30am--12:00pm
CPSC 311, GPA (Min GPR 3.4 required for catalog 126 or lower; min GPR 3.5 required for catalog 127 or greater)
MWF 10:20am-11:10am HRBB 126.
To understand the problems in AI and to learn how to solve them:
- traditional AI techniques (search, pattern matching, logical inference, theorem proving, etc.).
- modern approaches in AI (learning, probabilistic approaches, etc.).
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
See the Weekly Schedule section for more details.
- Introduction : 1 week
- LISP : 1 week
- Search : 1.5 weeks
- Game Playing : 0.75 week
- Propositional Logic, First-order logic: 3.5 weeks
- Uncertainty : 1 weeks
- Learning : 2.5 weeks
- Special Topics : 1 week
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.
The TAMU student rules (http://student-rules.tamu.edu/), Part I Rule 20 will be strictly enforced.Local course policy is as follows:
- All work should be done individually and on your own unless otherwise allowed by the instructor.
- Discussion is only allowed immediately before, during, or immediately after the class, or during the instructor's office hours.
- If you find solutions to homeworks or programming assignments on the web (or in a book, etc.), you may (or may not) use it. Please talk to the instructor first for permission.
The Americans with Disabilities Act (ADA) is a federal anti-discrimination statute that provides comprehensive civil rights protection for persons with disabilities. Among other things, this legislation requires that all students with disabilities be guaranteed a learning environment that provides for reasonable accommodation of their disabilities. If you believe you have a disability requiring an accommodation, please contact the Department of Student Life: Services for Students with Disabilities in Room 126 of the Koldus Building, or call 845-1637. (The source of this passage is TAMU Phil320 Syllabus.)
II. Resources |
III. Weekly Schedule and Class Notes |
|
|
|||||
1 | 1/17 | MLK Day (Holiday) | ||||
1 | 1/19 | Introduction | Chapter 1 1.1 and 1.2 |
slide01.pdf |
||
1 | 1/21 | Introduction | Chapter 26 26.1 and 26.2 |
slide01.pdf |
||
2 | 1/24 | Lisp | Lisp quick ref | slide02.pdf |
||
2 | 1/26 | " | Lisp quick ref | slide02.pdf |
||
2 | 1/28 | Uninformed Search (BFS,DFS,DLS,IDS) |
Chapter 3.1-3.5 (3.6,3.7 optional) |
Program #1 assigned; skeleton code (deriv.lsp) | slide03.pdf |
|
3 | 1/31 | Informed Search (BFS,Greedy,A*) |
Chapter 4.1-4.3 (4.4 optional) (old 4.1-4.3) |
slide03.pdf |
||
3 | 2/2 | " | slide03.pdf |
|||
3 | 2/4 | IDA*,Heuristic Search, Simulated Annealing, etc. |
Chapter 4 | slide03.pdf |
||
4 | 2/7 | " | slide03.pdf |
|||
4 | 2/9 | Game playing Min-Max, Alpha-Beta |
Chapter 5 (5.1 and 5.2 up to p. 144) and 6.1-6.8 (old 5) | Program #1 due (midnight: 11:59:59pm) | slide03.pdf |
|
4 | 2/11 | " | Homework #1 announced hw1.pdf | slide03.pdf |
||
5 | 2/14 | Game playing wrap up Propositional Logic |
Chapter 7.1, 7.3, 7.5, 7.6 (old 6) | Program #2 assigned: prog2.pdf; | slide03.pdf slide04.pdf |
|
5 | 2/16 | Theorem proving | Chapter 9 (old 10) | slide04.pdf |
||
5 | 2/18 | " | slide04.pdf |
|||
6 | 2/21 | First-order logic | Chapter 8 (old 7) | slide04.pdf |
||
6 | 2/23 | " | Homework #1 due | slide04.pdf |
||
6 | 2/25 | " | Homework #2 announced (hw2.pdf) | slide04.pdf |
||
7 | 2/28 | Inference for FOL |
Chapter 9 | slide04.pdf |
||
7 | 3/2 | Theorem proving for FOL |
Chapter 9 (old 10) | Homework #2 due | slide04.pdf |
|
7 | 3/4 | Midterm | Exam | |||
8 | 3/7 | " | Mid-semester grades due |
slide05.pdf |
||
8 | 3/9 | Uncertainty | Chapter 13 (old 14) | Program #2 due | slide05.pdf |
|
8 | 3/11 | " | slide05.pdf |
|||
9 | 3/14 | Spring Break | ||||
9 | 3/16 | Spring Break | ||||
9 | 3/18 | Spring Break | ||||
10 | 3/21 | Inductive Learning | Chapter 18 | slide06.pdf |
||
10 | 3/23 | " | slide06.pdf |
|||
10 | 3/25 | Reading Day: No class | ||||
11 | 3/28 | Learning (supervised) | Chapter 20 (old 19) | slide06.pdf |
||
11 | 3/30 | " | Program #3 Announced (Option 2) | slide06.pdf |
||
11 | 4/1 | No Class | Make-up: out-of-class review session at the end of the semester | To attend WAM-BAMM'05 | ||
12 | 4/4 | Learning (supervised) | Chapter 20 (old 19) | April 5 (Q-Drop) | slide06.pdf |
|
12 | 4/6 | " | slide06.pdf |
|||
12 | 4/8 | Unsupervised learning | slide06.pdf |
|||
13 | 4/11 | " | slide06.pdf |
|||
13 | 4/13 | " | slide06.pdf |
|||
13 | 4/15 | Evolutionary learning | Homework #3 announced | slide06.pdf |
||
14 | 4/18 | Semantics in autonomuos agents | Choe & Bhamidipati (2003) | Course Evaluation | slide07.pdf |
|
14 | 4/20 | Semantics in autonomuos agents | Choe & Bhamidipati (2003) | slide07.pdf |
||
14 | 4/22 | Analogy | Choe (2002) | Paper commentary announced | slide08.pdf |
|
15 | 4/25 | Analogy | " | slide08.pdf |
||
15 | 4/27 | Distributed Representation | Binary Spatter Code | slide09.pdf |
||
15 | 4/29 | Natural language processing | Chapter 22 (old 22) | Homework #3 Due | slide10.pdf |
|
16 | 5/2 | " | slide10.pdf |
|||
16 | 5/3 | Topic TBA | Program #3 Due | |||
5/10 | Final | Exam | 8:00-10:00am Paper commentary 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).