CS4341 Introduction to Artificial Intelligence
Small changes to this syllabus may be made during the course of the term.
Syllabus - D 2001
- Course Description
- Class Meeting
- Teaching Assistants
- Class Pictures
- Recommended Background
- Class Schedule
- Weekly Schedule
- Project 1 - due Friday, March 23, 2001 at 5 pm.
- Project 2 - due Friday, March 30, 2001 at 5 pm.
- Project 3 - due Friday, April 6, 2001 at 5 pm. Extended deadline: Saturday, April 7, 2001 at 5 pm
- Project 4 - due Saturday, April 14, 2001 at 5 pm.
- Project 5 - due Saturday, April 21, 2001 at 5 pm.
Extended deadline:Monday, April 23, 2001 at 5 pm.
- Connect4 Tournament - due Sunday, April 29, 2001 at 12 noon.
- Class Participation
- Class Mailing List
- Class Web Pages
- Additional Suggested References
- Other AI Resources Online
This is an introductory, upper level, undergraduate AI course.
We will cover general knowledge representation techniques and problem
solving strategies, including semantic nets, search, game playing,
rule-based systems, frames and inheritance, logic-based systems,
planning, and constraint satisfaction.
We will also discuss three
important application areas in AI: machine learning, machine vision,
and natural language processing.
For the catalog description of this course see the
WPI Undergraduate Catalog.
Mon, Tu, Th, Fri 10:00 - 10:50 a.m.
Prof. Carolina Ruiz
Office: FL 232
Phone Number: (508) 831-5640
| Mon. || 11:00 || - || 12:00 m.
| Th. || 3:00 || - || 4:00 pm, or by appointment
Room: FL A20
| Wed. || 11:00 || - || 12:00 noon
| Th. || 12:00 || - || 1:00 pm
| Fr. || 9:00 || - || 10:00 am
Room: FL A20
| Mon. || 3:30 || - || 4:30 pm
| Tu. || 1:00 || - || 2:00 pm
| Fr. || 2:00 || - || 3:00 pm
Greg Milette (Senior Assistant)
Room: FL A20
Messages sent to firstname.lastname@example.org reach both the instructor and the
Patrick H. Winston
"Artificial Intelligence". 3rd edition
Addison Wesley, 1993.
CS 2136 (Paradigms of Computation) and CS 2223 (Algorithms).
CS 3133 (Foundations of Computer Science) would be helpful, but is not
| Exam 1
| Exam 2
| Project 1 || 10%
| Project 2 || 10%
| Project 3 || 10%
| Project 4 || 10%
| Project 5 || 10%
| Project 2's tournament
|| Extra Points
| Class Participation and Pop Quizzes
|| Extra Points
Your final grade will reflect your own work and achievements
during the course. Any type of cheating will be penalized
with an NR grade for the course and will be reported to the WPI Judicial Board
in accordance with the
Academic Honesty Policy.
There will be a total of 2 exams.
Each exam will cover the
material presented in class since the beginning of the term.
In particular, the final exam is cumulative.
Exams will be in-class, 50 minute, closed-book, individual exams.
Collaboration or other outside assistance on exams is not allowed.
| Exam 1: || Thursday, || April 05
| Exam 2: || Tuesday, || May 01
Regarding makeup exams,
I follow Prof. Gennert's policy:
"Makeup and/or early examinations are not given except under the most
dire of circumstances, and then only with corroborating documentation.
Note well that neither oversleeping, forgetting to show up for an exam,
nor conflicting travel arrangements are considered dire circumstances."
There will be a total of 5 projects.
Code and Documentation
These projects may be implemented using any high level programming
language (Lisp, Prolog, C, C++, Java, ...).
Code documentation must follow the Departmental Documentation Standard
Students are expected to organize themselves into groups of exactly 4
for each of the projects.
Submissions and Late Policy
Late projects, with a 30% late penalty, will be accepted
until 9 am of the day after the project is due (i.e. Saturday).
ONLY projects submitted using the turnin
system by the deadline
or the late deadline (with the corresponding penalty)
will be accepted. ALL email submissions will be rejected.
More detailed descriptions of the projects will be posted to the course webpage
at the appropriate times during the term.
Although you may find similar programs/systems available online or in the
the design and all code you use and submit for your projects MUST be
your own original work.
Implement a search system that is able to perform all of the following
type of searches:
- Depth 1st search
- Breadth 1st search
- Depth-limited search
- Iterative deepening search
- Branch-and-bound (= Uniform cost search)
- Greedy search (= Best 1st search)
- Beam search
Design and implementation of a computer program that plays connect-4.
The programs implemented by the different groups will play against each other
in a tournament.
Design and implementation of a constraint-satisfaction system.
Design and implementation of a decision tree learning system.
Experimentation with neural networks and the error back propagation procedure.
Students are expected to read the material assigned to each
class in advance. Class participation will add extra points to
CLASS MAILING LIST
There are two mailing lists for this class: email@example.com and
- messages sent to firstname.lastname@example.org go to the entire class (professor, TAs,
and students), and
- messages sent to email@example.com go to the professor and the TAs only.
CLASS WEB PAGES
The web pages for this class are located at:
Announcements will be posted on the web pages and/or
the class mailing list, and so you are urged to check your email and
the class web pages frequently.
ADDITIONAL SUGGESTED REFERENCES
The following additional references complement and/or supplement
the material contained in the required textbook. I have listed
them in decreasing order of interest according to my preferences.
In particular, the first one listed is my favorite one.
S. Russell, P. Norvig. "Artificial Intelligence:
A Modern Approach". Prentice Hall, 1995.
T. Dean, J. Allen, Y. Aloimonos.
"Artificial Intelligence: Theory and Practice"
The Benjamin/Cummings Publishing Company, Inc. 1995.
B. L. Webber, N. J. Nilsson, eds.
"Readings in Artificial Intelligence"
Tioga Publishing Company, 1981.
S. L. Tanimoto.
"The Elements of Artificial Intelligence
Using Common Lisp"
Computer Science Press
E. Rich and K. Knight.
"Artificial Intelligence" Second edition
"Paradigms of Artificial Intelligence Programming:
Case Studies in Common Lisp"
Morgan Kaufmann Publishers, 1992.
"Essentials of Artificial Intelligence"
Morgan Kaufmann Publishers, 1993.
G. F. Luger and W. A. Stubblefield
Structures and Strategies for Complex Problem Solving"
M.R. Genesereth and N. Nilsson,
"Logical Foundations of Artificial Intelligence"
Morgan Kaufmann, 1987.
- Tom M. Mitchell
- P. Langley
"Elements of Machine Learning"
Morgan Kauffamann Publishers, Inc.
Lisp/Prolog Textbooks and Manuals
G. L. Steele Jr.
"Common Lisp: The language'' 2nd edition
Digital Press, 1990.
This reference is online.
Patrick H. Winston and Berthold K.P. Horn "Lisp" 3rd edition.
L. Sterling, E. Shapiro "The Art of Prolog" MIT Press, 1986.
OTHER AI RESOURCES ONLINE: