|
|
|
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: T/TR 11:00pm-12:30pm. Other times: by appointment.
Subramonia P. Sarma
Email: sps8556(a)cs.tamu.edu
Office: HRBB 322A
Phone: 845-5481
Office hours: M/W 2:30pm-4:00pm
CPSC 311
T/TR 9:35am-10:50am, ZACH 105B
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. To quote from the page, the following are unacceptable. See the same page for your rights.Local Course Policy:
- Acquiring Information: Acquiring answers for any assigned work or examination from any unauthorized source. Working with another person or persons on any assignment or examination when not specifically permitted by the instructor. Observing the work of other students during any examination.
- Providing Information: Providing answers for any assigned work or examination when not specifically authorized to do so. Informing any person or persons of the contents of any examination prior to the time the examination is given.
- Plagiarism: Failing to credit sources used in a work product in an attempt to pass off the work as one's own. Attempting to receive credit for work performed by another, including papers obtained in whole or in part from individuals or other sources.
- Conspiracy: Agreeing with one or more persons to commit any act of scholastic dishonesty.
- Fabrication of Information: The falsification of the results obtained from a research or laboratory experiment. The written or oral presentation of results of research or laboratory experiments without the research or laboratory experiment having been performed.
- Violation of Departmental or College Rules: Violation of any announced departmental or college rule relating to academic matters, including but not limited to abuse or misuse of computer access or information.
- Falsification of Information: Changing information on tests, quizzes, examinations, reports, or any other material that has been graded and resubmitting it as original for the purpose of improving the grade on that material.
- 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.
II. Resources |
III. Weekly Schedule and Class 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. #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 | " | 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/12 | Final | Exam | 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).