December 7, 6:45pm: All course notes through December 3 have been posted.
December 6, 1:30pm: Here's the definitive reading list for the final exam. Chapter 1, Chapter 2, Chapter 3, Chapter 4 except 4.7, Chapter 5, Chapter 6.1 and 6.2, Chapter 8 (we didn't talk about everything in Chapter 8, but the things we did talk about were drawn from across the chapter), and Chapter 11.1 and 11.2. As in the past, exam questions will tend to emphasize things we've discussed in class.
December 5, 4:10pm: PowerPoint slides are now posted for all lectures.
November 30, 8:20pm: Kaili asked for a practice homework assignment, so here it is. Click here to see the assignment that would have been an opportunity to improve your marks were in not for all the moaning and groaning (not to mention outright "boo"ing) yesterday. And if you'd like to look at a solution, you'll find that here.
November 19, 11:20pm: It looks like there's a team of UBC students that's already building an autonomous vehicle for the 2005 DARPA Grand Challenge. Find out more at www.ubcthunderbird.com. Are they from computer science? No. Try mining engineering.
November 19, 3:10pm: A new version of CILOG which includes the very desirable "bagof" predicate can be obtained here.
November 8, 10:55am: You can now find the term project pairings right next to where you found the term project details.
November 8, 1:40am: You can find links to more than 800 AI-related web pages at http://www.cs.berkeley.edu/~russell/ai.html.
November 8, 1:30am: The term project details are posted. Scroll down to the notes and slides for October 25 and you'll find the details there.
October 30, 11:20am: All course notes through October 27 have been posted.
October 3, 1:44pm: All course notes have been posted.
October 3, 12:14am: Solutions to homework assignments 1 and 2 are posted. Scroll down this page to where you found the assignments originally and you'll see links to solution sets.
Course Description: This course offers students the opportunity to explore the logical underpinnings of artificial intelligence, also known as AI (not to be confused with "AI", the disappointing film by Steven Spielberg). We'll begin with fundamental issues in reasoning and representation, then become well-versed in the role of search in problem solving. We'll conclude the term with a look at areas of interest within AI such as planning, expert systems, learning, and language processing. You won't be building robots, so you can leave your tool chests in the garage, but you will learn how to make your robot do useful things if you ever do build one.
Instructor: Kurt Eiselt
Office: CICSR 247
Electronic Mail: eiselt@cs.ubc.ca
Phone: 604-822-9880
Office Hours: Monday and Wednesday, 3:30pm to 4:30pm (or anytime the door is open)
Teaching Assistants:
The TAs will hold weekly office hours as follows:
| Name | Time | Day | Location |
| Navjot Singh nsingh@cs.ubc.ca | 10:30am to 12:30pm | Thursday | CICSR 238 |
| Qian Huang qhuang@cs.ubc.ca | 2:00pm to 4:00pm | Tuesday | CICSR 308A |
Course Newsgroup: ubc.courses.cpsc.322
How To Turn In Homework Assignments: We'll be using the handin system for turning in homework electronically. You should take a look at the man page for handin. The course number you'll need is cs322 and the first assignment is called asgn1.
Required Text: "Computational Intelligence: A Logical Approach" by David Poole, Alan Mackworth, and Randy Goebel (Oxford University Press, 1998).
Programming Environment: We use a reasoning and representation system called CILog in CPSC 322. Reading just the first few pages of the manual will tell you how to run CILog on department workstations and how to install it on your personal computer. CILog is an interpreter that runs on Prolog, and the preferred Prolog here is SWI-Prolog, which is available free of charge for Windows, Linux, and MacOS X platforms.
Self Help: Not the kind of self help where you go read a book to find out how to be happy. This is a different kind of happiness. There's a collection of Java applets that, as a whole, are called CIspace, and these applets are tools that allow you to set up and explore different examples from the realm of Computational Intelligence. You should check this stuff out.
Tentative Course Requirements and Grading: There will be several homework assignments throughout the term to be completed individually. There will also be one term project to be completed by teams of students. We'll talk more about term project details after the first midterm exam. There will be two midterm examinations, one on Monday, October 4, and one on Monday, November 1. And of course there will be a final exam, with the date yet to be determined.
How will your final grade be determined? Here's how each deliverable contributes:
homeworks 10.0%
team project 20.0%
midterm 1 20.0%
midterm 2 20.0%
final exam 30.0%
------
total 100.0%
I reserve the right to adjust the details in this section during the first two weeks of the course, so revisit this page in a couple of weeks.
Late and Make-Up Policy: Homework assignments are due by the day and time specified in their respective descriptions. Late submissions will not be accepted. Students are expected to arrive for exams on time. In order to protect the integrity of the evaluation process, students arriving late for an exam may not be allowed to take the exam. Any requests for exceptions to this policy due to University-approved absence from campus, incapacitating illness, death in the family, or something similarly serious must be accompanied by supporting documentation.
Collaboration and Cheating
You may work on your homework assignments on your own, or you may collaborate with one other student from this class. You may not work in groups of three or more students. And it should go without saying that you are not permitted to collaborate on midterm exams or the final exam.
Week 1
Week 2
Week 3
Week 4
Week 5
Week 6
Week 7
Week 8
Week 9
Week 10
Week 11
Week 12
Week 13
Exam Period
Last revised: December 7, 2004