22c145 - Artificial Intelligence

Fall 2000

Course Syllabus

Instructor

Prof. Cesare Tinelli
201E MLH
335-0735
tinelli@cs.uiowa.edu

Office hours: Mon 3:30-5pm, Wed 2-3:30pm, or by appointment.

 

Teaching Assistant

George (Jed) Hagen
101K MLH
353-2542
ghagen@cs.uiowa.edu

Office hours: Tue 1-2:30pm, Fri 10-11:30am.

 

Lectures

TuTh 2:30-3:45pm, 110 McLean Hall.

 

Prerequisites

Grades of C- or above in 22C:034 and 22C:044.

 

Web Page

Most of the information about the class, including handouts and assignments, will be available from the class web site:

www.cs.uiowa.edu/class/c145

You are expected to check both the web site and its related bulletin board daily for announcements regarding the course.

 

Textbook

Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall, 1995.

In addition, a number of class notes and handouts will be available through the course web site.

 

Course Purpose

This is a survey course. Its purpose is to introduce students to a wide variety of topics and techniques in Artificial Intelligence (AI). Students should be prepared to put in a lot of time and effort reading to become familiar with these topics, and some programming to gain experience with these techniques. At the end of the semester, students should have the knowledge required to identify areas which they would like to investigate in more depth. This knowledge includes:

 

Homework

 

Exams

There will be one midterm exam and one final exam. The midterm will be held during class time. The final exam will be held as per university schedule and last no more than 120 minutes.

 

Grading

The weighting of items in grade determination will be the following:

Team Project 10%
Homeworks 25%
Midterm I 30%
Final Exam 35%

If we have team projects, or the following:

Homeworks 35%
Midterm I 30%
Final Exam 35%

if we do not.

The following cutoffs will be used to determine letter grades. In the ranges below, x stands for your total score at the end of the semester. Final scores near a cutoff will be individually considered for the next higher grade. Plus(+) and minus(-) grades will also be given; their cutoffs will be determined at the end of the semester.

Score  Grade
88 <= x < 100 A
75 <= x < 88

B

60 <= x < 75 C
50 <= x < 60 D
00 <= x < 50 F

We do not curve grades in this course. It is theoretically possible for everyone in the class to get an A (or an F). Your final grade depends only on your own performance, not on how everyone else in the class does.

 

Course Policies

Textbook: You are expected to study all the material in each chapter covered in the readings even if that material is not explicitly discussed in class or in the homework. You are also expected to study the extra material presented in class which is not in the textbook. If you must miss a class, get notes from a classmate. Material presented in class, but not in the book may appear on tests.

Class notes: The class notes are a supplement to the course textbook. They are supposed to help you understand the textbook material better, they are not a replacement for the textbook.

Readings and discussions: You are urged to consult sources other than our text, including both reserve books and on-line material, even if there is no directed outside reading assignment. You are also encouraged to discuss the course topics with your classmates. It is a genuinely helpful learning activity having to formulate your own thoughts about the material well enough to express them to others.

Homework assignments: You are allowed and encouraged to discuss the homework assignments with your classmates, but you are not allowed to share solutions. Since the homework counts as a significant portion of your grade, it is expected that the submitted work be strictly your own.
(The following rule of thumb will help you not to cross the line: discuss the assigments together but do not take any written notes; go home and write the solution by yourself.)

Cheating: Copying someone else's work or sharing solutions will result in a zero on the assignment for the first offense and an F in the course for the second offense.

Late submissions: Written assignments are to be submitted in class, before the class starts. Late written assignments can be handed in during office hours or in class. Alternatively, they can be put in the instructor's or the TA's mailbox. In that case, you must notify us by email at once.
Programming assignments are to be submitted electronically by or after the given deadline, subject to the penalty and limitations below.
Both late written and programming assignments will be graded according to the following policy:

Sundays are excluded from the count of late hours.

Team Project: If we have a team project, it will start in mid-semester. The project policy will be released then.

Attendance: Students are expected to attend all classes. Your knowledge and therefore your grade depends on it. You are responsible for all announcements and material covered during class even if you did not attend. In that case, check with the instructor or with your classmates.

Extra credit: No extra-credit homeworks or tests will be given on an individual basis (although they maybe given to the whole class).

Make-up exams: Make-up exams will be offered only if there is a serious, documented reason for not being able to attend a scheduled exam, and if the request is made at least a week before the scheduled exam.

Regrading: If you think that your homework assignment has been misgraded and deserves a regrading, you are invited to let us know. Go see the class TA first, and then the instructor, if you are unhappy with the TA's response. Regrading policies for the midterm will be announced in class when the graded exams are handed back. We welcome and will give full consideration to all well motivated regrading requests.

Special needs: The instructors must hear from anyone who has a disability that may require some modification of seating, testing, or other class requirements so that appropriate arrangements can be made. Please see the instructor after class or during office hours.

 

Computing Facilities

We will use the HP workstations in the CS Educational Lab in 301 MLH. Please see the instructor after class if do not have a CS account yet.

 

Outline

The topics that will be covered in the course are outlined below. The outline is tentative and will be adjusted as necessary during the course of the semester.

Class
periods
Topic Textbook
Readings
1 Introduction Chap. 1
1 Intelligent Agents Chap. 2
4 Problem Solving and Search Chap. 3, 4
2 Knowledge Representation and Reasoning Chap. 6, 7
4 Logical Inference Chap. 7, 9
4 Planning Chap. 11, 12
1 Midterm All of the above
4 Reasoning with Uncertainty Chap. 14, 15
3 Machine Learning Chap. 18
2 Neural Networks Chap. 19, 20
3 Natural Language Understanding Chap. 24
1 Social/Philosophical Implications of AI Chap. 26, 27
- Final Exam (comprehensive) All of the above except Chap. 26, 27