CPSC 625-600 AI: Fall 2008 http://courses.cs.tamu.edu/choe/08fall/625/1 of 4 08/25/08 22:28CPSC 625-600 Artificial Intelligence:Fall 2008Syllabus (print this page)NEWS: 8/25/08, 09:52PM (Mon)[8/25] Course web page goes online[LINKS] • News archive• Grades• Codes• Lecture notesRead-Only Bulletin Board.: 8/25/08, 08:57PM (Mon)Page last modified: 8/25/08, 10:22PM Monday.General Information Resources Weekly Schedule Credits Lecture Notes Example Code Read-Only BoardI. General InformationInstructor:Dr. Yoonsuck ChoeEmail: choe(a)tamu.eduOffice: HRBB 322BPhone: 979-845-5466Office hours: Tue/Thu 2:00pm–3:00pm.TA:None Prerequisite/Restrictions:CPSC 311 or equivalentLectures:Tue/Thu 12:45pm-2:00pm, HRBB 113Goals:To understand the problems in AI and to learn how to solve them:traditional methods in AI (search, pattern matching, logical inference, theorem proving, etc.).1.modern approaches in AI (learning, probabilistic approaches, etc.).2.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* The first edition may be okay if that’s what you have.Computer Accounts and Usage:Computer accounts: if you do not have a unix account, ask for one on the CS web page. We will be using theCMU Common Lisp as our main language. You may use a different language but example code will only bemade available in Lisp.1.CPSC 625-600 AI: Fall 2008 http://courses.cs.tamu.edu/choe/08fall/625/2 of 4 08/25/08 22:28CMU Common Lisp:Carnegie Mellon U. Common Lisp homepageOn all SunOS systems in the department (sun.cs.tamu.edu etc.), the program is installed in/opt/apps/cmucl/bin/lisp.See the Read-only Board for a brief example.2.Topics to be covered:See the Weekly Schedule section for more details.Introduction1.LISP2.Search3.Game playing, alpha-beta pruning4.Propositional Logic, first-order logic, theorem proving5.Uncertainty, probabilistic approaches6.Learning7.Special topics8.Grading:Exams: 30% (midterm: 15%, final: 15%)1.Homeworks: 15% (about 3, 5% each)2.Programming Assignments: 24% (about 2, 12% each)3.Term project and report: 31%4.Grading will be on the absolute scale. The cutoff for an ‘A’ will be 90% of total score, 80% for a ‘B’,70% for a ‘C’, 60% for a ‘D’, and below 60% for an ’F’.If you are absent without any prior notification to the instructor, your class participation score will be setto 0% at the very first occurrence, except for excuses allowed by the university rules (medical, etc.).Academic Integrity Statement:AGGIE HONOR CODE: An Aggie does not lie, cheat, or steal or tolerate those who do.Upon accepting admission to Texas A&M University, a student immediately assumes a commitment touphold the Honor Code, to accept responsibility for learning, and to follow the philosophy and rules ofthe Honor System. Students will be required to state their commitment on examinations, research papers,and other academic work. Ignorance of the rules does not exclude any member of the TAMU communityfrom the requirements or the processes of the Honor System.For additional information please visit: http://www.tamu.edu/aggiehonor/Local Course Policy:All work should be done individually and on your own unless otherwise allowed by theinstructor.Discussion is only allowed immediately before, during, or immediately after the class, or duringthe 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 check with the instructor.Students with Disabilities: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 Cain Hall or call 845-1637.CPSC 625-600 AI: Fall 2008 http://courses.cs.tamu.edu/choe/08fall/625/3 of 4 08/25/08 22:28II. ResourcesLISP quick reference1.CMU Common Lisp (This one will be used in the class.)2.GCL manual (very in-depth and technical).3.GNU Common Lisp4.Lisp resources5.My general resources page6.625/689 Reading List7.An interesting popular view of AI8.Chess playing program (with neat visualization)9.III. Weekly Schedule and Class NotesLecture notes (in PDF format): all notes will be uploaded in this directory.It is your responsibility to download, print, and bring the notes to the class. Notes will be available 24 hoursbefore each class.See the TAMU Calendar for breaks, etc.When reading the chapters, you do not have to memorize everything. A separate list of terms you need to knowwill be handed out prior to each exam.All reading material below refers to the AIMA book 2nd edition. The (old XX) tags next in the Reading fieldare the corresponding chapters in the old AIMA book (1st edition). To see how the 1st and the 2nd editionchapters correspond, see the "AIMA 1st and 2nd edition chapter map".More detail will be available as we go along.Week Date Topic Reading Assignments Notices and Dues Notes1 8/26 IntroductionChapter 11.1 and 1.2 First day of class slide01.pdf1 8/28 IntroductionChapter 2626.1 and 26.2 slide01.pdf2 9/2Lisp, Symbolic Differentiation Lisp quick ref 2 9/4Uninformed Search (BFS,DFS,DLS,IDS)Chapter 3.1-3.5 (3.6,3.7 optional) 3 9/9Informed Search (BestFS,Greedy,A*)Chapter 4.1-4.3 (4.4 optional)(old 4.1-4.3) 3 9/11IDA*,Heuristic Search,Simulated Annealing, etc.Chapter 4 4 9/16Game playingMin-Max, Alpha-BetaChapter 5 (optional) and 6.1-6.8 (old 5) 4 9/18 Game playingChapter 5 (optional) and 6.1-6.8 (old 5) 5 9/23Game playing wrap up; Propositional LogicChapter 7.1, 7.3, 7.5, 7.6 (old 6) 5 9/25 Theorem proving Chapter 9 (old 10) 6 9/30FOL; Theorem provingfor FOLChapter 8 (old 7); Chapter 9 (old 10) 6 10/2Inferencefor FOLChapter 9 7 10/7Midterm ExamIn classCPSC 625-600 AI: Fall 2008 http://courses.cs.tamu.edu/choe/08fall/625/4 of 4 08/25/08 22:287 10/9 Uncertainty Chapter 13 (old 14) 8 10/14 Uncertainty Chapter 13 (old 14) 8 10/16 UncertaintyChapter 13 (old 14), Chapter 14 (old 15) 9 10/21 Learning Chapter 14 (old 15) 9 10/23