CPSC 322 - Introduction to Artificial
Intelligence (Term 2, Session 201, 2006)
[ Overview | Grades | Text | Schedule | Handouts] |
Overview |
Course Description: This course provides an introduction to artificial intelligence. The major topics covered will include reasoning and representation, search, constraint satisfaction problems, planning, logic, reasoning under uncertainty, planning under uncertainty, multiagent systems.
|
Grades |
The assignment grade will be computed by adding up the number of points a student got across all assignments, dividing this number by the number of possible points, and multiplying by 20. Note that this means that assignments are not weighted equally when they are out of a different number of points. Late Assignments: Assignments are to be handed in IN CLASS at the start of lecture on the due date. However, every student is allotted three "late days", which allow work to be handed in late without penalty on three days or parts of days during the term. How late does something have to be to use up a late day? A day is defined as a 24-hour block of time beginning at 4 PM on the day an assignment is due. To use a late day, write the number of late days claimed on the first page of your assignment and submit your assignment to the course drop box located in the basement of CICSR, or just bring it to class if it's less than an hour late. Examples:
The purpose of late days is to allow students the flexibility to manage unexpected obstacles to coursework that arise during the course of the term, such as travel, moderate illness, conflicts with other courses, extracurricular obligations, job interviews, etc. Thus, additional late days will NOT be granted except under truly exceptional circumstances. Late assignments will no longer be accepted from students who have used up all of their late days. Academic Conduct: Submitting the work of another person as your own (i.e. plagiarism) constitutes academic misconduct, as does communication with others (either as donor or recipient) in ways other than those permitted for homework and exams. Such actions will not be tolerated. Specifically, for this course, the rules are as follows:
Violations of these rules constitute very serious academic
misconduct, and they are subject to penalties ranging from a grade of
zero on the current and *all* the previous assignments to indefinite
suspension from the University. More information on procedures and
penalties can be found in the
Department's Policy on Plagiarism and collaboration and in
UBC
regulations on student discipline . If you are in any doubt about
the interpretation of any of these rules, consult the instructor or a
TA!
|
Text |
We will be using a new text under development, which is
currently only available in electronic form: the second edition of
Computational Intelligence by Poole, Mackworth and Goebel. (This is
great news for students: not only will the text be free, but it is also
considerably more up-to-date than the text used in previous iterations
of this course.) PDF files of the chapters covered in class will be
added to WebCT as they are needed.
Although this text will be our main reference for the
class, it must be stressed that you will need to know all the material
covered in class, whether or not it is included in the readings or
available on-line. Likewise, you are responsible for all the
material in assigned readings, whether or not it is covered in class.
|
Schedule |
For Assignment 5 there are
no late days.
Electronic submission is allowed; see WebCT for
email address. This assignment is optional: if you don't hand it
in, your assignment grade will be calculated based on the previous four
assignments. If you do hand it in, your assignment grade will be
the maximum of your assignment grade over all five assignments and your
assignment grade on the first four assignments (i.e., you can't lose by
handing in assignment 5). |
Handouts |
Please note that the links to slides and to assignments are given in the schedule above. The textbook chapters are only available through WebCT. Other handouts follow:
|