Course Description:
[from the Cal Poly 2005-7 Catalog]
"Programs and techniques that characterize artificial intelligence.
Programming in a high level language. 3 lectures, 1 laboratory. " Prerequisites:
CSC 103 (Fundamentals of Computer Science III)
and CSC 141 (Discrete Structures I).
Students should be familiar with programming in Java,
and be able to work with elementary statements in propositional
and predicate logic.
Goals and Objectives
The goal of this course is to understand important problems, challenges,
concepts and techniques from the field of Artificial Intelligence.
In order to achieve this, students learn how to analyse, design, and
program intelligent agents of varying complexities. These agents gather information
from their environment, convert it into a suitable internal representation
(which may be augmented with information provided by the designer or other sources),
analyse their internal knowledge to determine suitable actions,
and finally execute some actions.
More specifically, after successfull completion of the course, students should
know classical examples of artificial intelligence
be able to identify critical aspects of intelligence in humans and in computer-based systems
know characteristics of programs that can be considered "intelligent"
understand the use of heuristics in search problems and games
know a variety of ways to represent and retrieve knowledge and information
know the fundamentals of artificial intelligence programming techniques
in a modern programming language
consider ideas and issues associated with social technical,
and ethical uses of machines that involve artificial intelligence
There is a column in the course schedule
indicating the chapters in the book that correspond to a topic discussed in class.
Students are expected to read the respective chapters before the topic is covered in class.
For further reading, here are some more suggestions:
The lecture notes from
MIT's course on Artificial Intelligence
are available through their OpenCourseWare project at
ocw.mit.edu.
The topics covered are similar to ours, and some of the notes
contain nice examples.
The fourth edition of "Artificial Intelligence - Structures and
Strategies for Problem Solving"
by George F. Luger ,
Addison Wesley, 2008, ISBN 9780321545893
is based on a more traditional approach to AI, with less emphasis
on intelligent agents.
The table shown gives an overview of the calculation of the grades.
I reserve the right to change the formula used.
Please note that the project consists of several parts which will be evaluated separately.
The project will be done in teams, and the performance of the team as a whole
will be graded unless there is a clear disparity in the contribution
of the individual team members.
Should this be the case, I might ask for additional documentation like work sheets,
email messages, or draft copies of documentation to evaluate individual contributions.
Student scores will be made available via Blackboard. If you notice any discrepancies
between an entry on Blackboard and the score indicated on the returned work,
please let me know.
Academic Dishonesty and Cheating
You are expected to adhere to Cal Poly's Code of Student Conduct, Rights and Responsibilities.
Academic dishonesty can be a serious offense.
Any instances of cheating or plagiarism may be reported to the department chair
and the Office of Student Rights & Responsibilities (OSRR).
The Cal Poly rules and policies are listed in the catalog (page 24 in the 2003-2005 edition),
as well as at the OSRR web site,
http://www.calpoly.edu/~osrr/index.html.
If the rules are unclear or you are unsure of how they apply, ask the instructor beforehand.
We may use programs or services like Moss to compare assignments
within a section, across all current sections of this class, and with old assignments.
While such programs are not perfect, they detect suspicious similarities
even after replacement of variable names and other identifiers.
Turning in work is presumed to be a claim of authorship unless
explicitly stated otherwise.