Download CS255 Course Syllabus, Spring 2011 - CIS Department

CS255, Introduction to Artificial Intelligence
Spring 2011, (3 credits)
Section 1, Monday & Wednesday 3:00-4:15pm
_________________________________________________________________________________________
INSTRUCTOR: Dr. Cynthia J. Martincic
OFFICE HOURS: Mon. noon-2pm,
OFFICE: 202 Physics Building
Wed., Fri. 9am -10am
PHONE: 724-805-2418 or x2418
Tu., Th.1pm-2pm
EMAIL: [email protected]
Also by appt. or drop-in.
_________________________________________________________________________________________________
PREREQUISITES:
CS111
COURSE DESCRIPTION:
This course is an introduction to artificial intelligence theory and applications. The course will emphasize the understanding of theoretical
foundations of representation, reasoning and search. We will also look at the history of AI and some of the major issues in the field. Successful
completion of this course will require the completion of assignments, two or three projects, and passing quizzes and three exams.
LEARNING OBJECTIVES AND ASSESSMENT:
Upon completion of this course the student will be able to:
*
define and describe the field of Artificial Intelligence in terms of its theoretical foundations.
*
describe and differentiate among some of the major techniques for representation and reasoning.
These objectives will be assessed mainly through the use of homework assignments, small projects and exams.
SUPPORT OF THE SVC CORE CURRICULUM GOALS
This course supports the following SVC Core Curriculum Goals:

To form habits of ordered inquiry, logical thinking and critical analysis

To develop effective communication skills

To foster historical awareness of the discipline

To develop mathematical skills and quantitative literacy
TEXT: Artificial Intelligence: Structures and Strategies for Complex Problem Solving.6 th Ed. Luger, G. F. A. (2009) Addison Wesley Longman,
Inc. ISBN 0201-64866-0
ADDITIONAL READINGS:
•
Python Tutorial at http://docs.python.org/tutorial/introduction.html
•
Other readings May be assigned during the course of the semester
GRADING:
Assignments, Projects and
In-class Quizzes:
Exams:
50%
50%
GRADING SCALE:
The final grading scale may be curved at the discretion of the instructor, but in order to monitor your progress during the term, you should assume
the SVC grading scale as printed in the College Bulletin. Curved grades will result in a higher letter grade than that achieved solely by the
percentages above. For example, an earned ‘B’ may become a ‘B+’. The curve depends upon the performance of the class as a whole as well as
individual class participation and perceived effort.
EXAMS:
There will be three exams, which, in total, will account for fifty percent of the final grade. Exams may cover any topics discussed in class, in the text,
in any additional readings and in the assignments. Exams must be taken when scheduled. One 8.5x11 page of handwritten notes may be brought to
the exams. No other books, notes, electronic devices or other assistance (including other people) are to be used during exams. Cell phones, pagers,
PDAs, calculators, beeping watches and computers must be turned off during exams. Once an exam has begun, you are not permitted to leave the
room until you hand in the exam.
If any students miss one of the first two exams due to verifiable extreme circumstances, the average of the other exam and the final will be used as the
grade for the missed exam. (For a definition of “verifiable extreme circumstances” see the Section labeled “DEFINITION OF EXTREME
VERIFIABLE CIRCUMSTANCES”.) Missing an exam for a reason that is not extreme and verifiable will result in a grade of zero for that exam.
PROJECTS:
The projects for this course are meant to provide you with a feel for some of the computational methods discussed. One will require you to learn
some Python. You can download Python (we are using version 2.7 in the CIS lab) from python.org. If you do not choose to download it to your
own computer, or cannot download it to your own computer, you will need to use the CIS lab for the assignments requiring Python. The other
project will be done in Visual Studio 2008.
CS255, Introduction to Artificial Intelligence.
COURSE POLICIES:
If you cannot attend a class: You are still responsible for anything that was covered or done in class, or was due to be turned in. If you miss a class,
it is your responsibility to get any notes, or handouts. Quizzes may be made up by making an appointment with the instructor within one week of the
date the quiz was given in class. Exceptions will be allowed only in cases of extreme verifiable circumstances.
In order to complete phases of the projects in a timely fashion, you will be expected to read some material in the text prior to the time it is covered
formally in class and use this material to produce the required deliverables for your project. Additionally, in order to complete the projects, many of
you will need to learn additional technical programming skills on your own.
For all assignments, quizzes and exams, illegible answers will not be graded and no points will be awarded
Do not turn in any exercise or assignment on paper torn from spiral-bound notebooks or on any size paper other than 8.5x11 inch. Multiple pages
must be stapled together. No points will be awarded if multiple pages are not stapled or paper-clipped.
Students with disabilities who may be eligible for academic accommodations and support services should please contact Mrs. Sandy Quinlivan by
phone (724-805-2371), email ([email protected]) or by appointment (Academic Affairs-Headmaster Hall). Reasonable
accommodations do not alter the essential elements of any course, program or activity.
Students who are participating in sports are expected to follow the College Handbook procedures for excused absences from class and exams.
Plagiarism of any type will not be tolerated. Plagiarism includes the direct copying of another’s work as well as use of another’s ideas or concepts
including, but not limited to, material in books or journal articles, material from other students and information found on the Internet. Care should
be taken to make sure your answer is not “unduly similar” to the text in the book or elsewhere. “Unduly similar” in this case means that a prudent
individual would reasonably conclude that the text and your answer were written/completed by the same person. The assignment grades for those
students involved will be severely penalized and the incident will be reported to the Academic Deans Office. The Academic Honesty policy
contained on page 32 of the 2003-2005 Saint Vincent College Bulletin will be adhered to in this course. Please refer to the Bulletin for details. Any
detected attempts at plagiarism, deception or cheating in the assignments or exams will be severely penalized.
Class attendance is most strongly recommended. Some classes will include in-class assignments, quizzes or computer lab work for which points
will be awarded. Additional points may be added to the final grade based upon class participation. If you miss a class, it is your responsibility to get
any notes, handouts and assignments. If a medical or sport excuse is provided, you will be given the opportunity to make up missed in-class labs or
quizzes. You are permitted to miss one week worth without penalty. For every unexcused absence after the allowed, 3 points will be deducted
from your final grade.
Everyone involved in this class is expected to treat others with respect. Respectful behavior includes minimizing distractions during class. Cell
phones, pagers, beeping watches extra should be muted during class. If you have a need to keep a cell phone or pager on during class, please let me
know.
If a class or office hours must be canceled for any reason, I will try to contact each of you by email as soon as I know of the cancellation and it will
be posted on the course BB site. If assignments are due when a class has been canceled, they may be turned in at the next class without penalty.
Please check that your email address on Blackboard is one that you check regularly.
Students should consult the CIS Department Policies webpage (http://cis.stvincent.edu/policies.html) for additional information regarding course and
department policies.
DEFINITION OF EXTREME VERIFIABLE CIRCUMSTANCES
Examples of extreme circumstances are serious illnesses or the death of a family member. Examples of non-extreme circumstances are
nonrefundable airline tickets, sporting events and concerts. Proof of the extreme circumstance will be required, such as a note from a nurse, doctor or
coach, or an obituary notice.
OTHER REFERENCES:
Artificial Intelligence Illuminated. Coppin, B. (2004) Jones and Bartlett Pub. ISBN0-7637-3230-3.
Artificial Intelligence: Structures and Strategies for Complex Problem Solving.6th Ed. Luger, G. F. A. (2009) Addison Wesley Longman, Inc. ISBN
0201-64866-0.
Artificial Intelligence, 2nd Edition Elaine Rich and Kevin Knight 1991, McGraw-Hill, Inc.:NY
Artifical Intelligence: A Modern Approach 3rd Ed. Stuart Russell and Peter Norvig 2010, Prentice-Hall, Inc.: Upper Saddle River, NJ
http://en.wikipedia.org/wiki/ELIZA
http://www.informationweek.com/news/global-cio/showArticle.jhtml?articleID=206903443
2
CS255 Course Syllabus, Spring 2011
(Subject to modification as the term progresses.)
Week
Beg.
Topics, Readings and Assignments
1/10
 Course pragmatics
 Ch. 1 What is AI? The history of AI
 Intro to Python
Assignment #1 (1 point) - send me an email with the following information. . (1) Name, (1a)Name you
wish to be called, (2) Preferred Email Address, (3) Phone Number(s), (4) Campus Post Office Box
number (or local address), (5) Class Year: (e.g., Freshman, Sophomore, Junior, Senior), (6) Your
reasons for taking this course, (7) Your previous programming and computer experience.
Future assignments will be announced in class and posted on Blackboard .
1/17
1/24
1/31
2/7
2/14
2/21
2/28
3/7
3/14
3/21
3/28
4/4
4/11
4/18
4/25
5/2
 Ch. 2 The predicate calculus (p45-64)
 Python – strings, lists, control flow
 Ch. 2 The predicate calculus – (p64-76)
 Python - functions
 Ch. 3 Structure and Strategies for State Space Search
 Python - beginning to build the pattern matcher
 Ch. 4 Heuristic Search (p123-145)
 Python – exception handling, recursion
  Exam 1 This week. 
 Ch. 4 Heuristic Search (p145-162)
 Python – match functions
 Ch. 5 Stochastic Methods
 Python – match functions
 Spring Break ☺☼☻ 2/26 – 3/6
 Ch. 6 Building control algorithms for state space search
 Python - backtrack match functions
 Ch. 7 Knowledge representation
 Python – rules for eliza
 Ch. 8 Strong Method Problem-solving
 Python – finishing interaction with eliza
  Exam 2 This week. 
 Ch. 10 Machine Learning – symbol based
 Ch. 11 Machine Learning - connectionist
 Neural Networks project assigned
 Ch. 14 Automated Reasoning (575-603)
 No Class Wednesday, April 13th due to Honors Convocation
 Ch. 15 Understanding Natural Language
 Easter Break 4/21-4/25 No Class on Monday April 25th
 Ch. 9 Reasoning in Uncertain situations
 Final Exam  Mon. May 2, 4pm-6pm