|Recitation R1||Goetz||CS472: 289789
|Recitation R3||DeAngelo||CS472: 091281
|Recitation R4||closed||CS472: 481385
|Monday||January||29||First meeting of R3|
|Tuesday||January||30||First meeting of R1|
|Friday||February||2||Last day to add or drop|
|Friday||February||2||Homework 1 due|
|Friday||February||16||Project 1 originally due|
|Monday||February||19||Project 1 due|
|Tuesday||February||20||Homework 2 due by midnight|
|Friday||March||8||Homework 3 due|
|Friday||March||15||Homework 4 due|
|Friday||March||15||Last day to withdraw with a grade of ``R''|
|Wednesday||March||27||Project 2 due|
|Monday||April||1||No Class - UBGCCS|
|Friday||April||26||Homework 5 due|
|Tuesday||April||30||Last meeting of R1|
|Wednesday||May||1||Project 3 due|
|Monday||May||6||Last meeting of R3|
|Monday||May||6||Last meeting of Lecture|
|Tuesday||May||14||Final Exam, 3:30-6:30, Fronczak 422|
|Monday||January||29||Chapter 2||Intelligent Agents|
|Friday||February||2||Chapter 3||Solving Problems by Searching|
|Friday||February||9||Chapter 4||Informed Search Methods|
|Friday||February||16||Chapter 5||Game Playing|
|Monday||February||19||Chapter 6||Agents that Reason Logically|
|Monday||March||4||Chapter 7||First-Order Logic|
|Friday||March||8||Chapter 9||Inference in First-Order Logic|
|Monday||March||25||Chapter 10||Logical Reasoning Systems|
|Wednesday||April||17||Chapter 22||Agents that Communicate|
|Wednesday||April||24||Chapter 26||Philosophical Foundations|
|Wednesday||May||1||Chapter 27||AI: Present and Future|
sunyab.cs.572. You may post questions and comments there that are of general interest to the entire class.
For each project, you will be expected to hand in a paper, typed or printed from a computer file, on 8.5 by 11 inch paper (stapled in the upper left-hand corner, without sprocket holes, and with your own title page), plus a well documented listing of your program. The listing should either be presented as figures throughout the paper, or as an appendix. In either case, the listing is included as documentation for what you say in the paper. The main product of your work is the paper, not the program! In the paper, you should say what you have done, and how (in English summary, not in programming detail) you have done it. It should also include annotated examples of your program in action. These should be well chosen to illustrate the range of performance of your program. The examples should not be redundant, nor included merely because they look complicated. Each example should illustrate a particular ability of your program. Nevertheless, the reader will assume that your program does nothing interesting that isn't illustrated! In addition, you are to submit your program to your TA, so that it can be run and checked if the TA so chooses.
A sample paper is available.
You will have two to four weeks to do each project. The due date and time will be announced when the project is assigned. Because several courses are using the same computer, project due dates of the different courses must be staggered to prevent overloading. Therefore NO LATE PROJECTS WILL BE ACCEPTED.
It is perfectly acceptable to use programming ideas and even code from the published literature. However, if you do so, you must cite your sources, or be guilty of plagiarism. Similarly, while it is acceptable to discuss general approaches with your fellow students, the work you turn in must be your own. If the work of two or more students appear unjustifyably similar, penalties will be assessed to all concerned. If you have any problems doing the projects, consult the TAs or the Lecturer.
Grading: Projects will be judged by the following criteria:
|Content of paper||20%||30%|
|Style of paper||10%||20%|
|Choice of demonstration examples||10%||20%|
|Correctness of program||40%||20%|
|Style of program||20%||10%|
Projects will be given both a numeric and a letter grade.
The final course grade will be the weighted average grade, truncated if necessary. For example, F- and F+ will be truncated to F, and D- will be truncated to D.