Course Number: CS305
Course Title: Introduction to Artificial Intelligence
Instructor: Mary Heidt
phone: (915) 757-0258
Term Dates: Oct 10 – Dec 3, 2005
Class Time: Mon/Wed 5:00 – 7:30 p.m.
1. COURSE DESCRIPTION
The student will learn the terminology and methods used in a variety of artificial intelligence areas. Course topics may include (but are not limited to): expert systems, neural networks, vision case based reasoning. The student may use various AI tools, Lisp, and/or Prolog for AI projects. Prerequisite: CS 352. 3:0:3
2. GOALS OF THE COURSE
This course seeks to introduce students to a view of AI based around the idea of intelligent agents—systems that can decide what to do and then do it. Students will learn methods of representing knowledge about the world and how to reason logically about that knowledge. Methods of planning will be introduced. Students will implement planning and knowledge representation using both structural and declarative programming techniques.
3. LEARNING OBECTIVES
At the end of this course the student should be able to:
4. COURSE ARRANGEMENT
This course will consist of lectures, reading assignments, homework assignments, programming assignments, and tests.
5. COURSE REQUIREMENTS
Students are responsible for all reading, homework, and programming assignments. All assignments are due at the beginning of class. Students are expected to backup all programs and will submit both a hard copy and disk for programming assignments. Students may discuss programming assignments in a general way with other students, but solutions must be done independently. Graded work must be unmistakably your own and may not be copied from another source.
Russell, Stuart J. and Norvig, Peter, Artificial Intelligence, A Modern Approach, 2nd edition, Prentice Hall, 2003, ISBN 0-13-790395-2 .
7. CLASS MEETING AND EXAMINATION SCHEDULE
Oct 10: Introduction to Artificial Intelligence (Chapter1); Introduction to Prolog
Oct 12: Intelligent Agents(Chapter 2)
Oct 17: Solving Problems by Searching (Chapter 3)
Oct 19: Search with Prolog
Oct 24: Informed Search and Exploration(Chapter 4)
Oct 26: Exam 1
Oct 31: Logical Agents(Chapter 7)
Nov 2: First Order Logic(Chapter 8)
Nov 7&9: Unification and Resolution(Chapter 9)
Nov 14: Knowledge Representation(Chapter 10)
Nov 16: Exam 2
Nov 21 & 23: Answer Set Programming
Sept 28: Review
Sept 30: Final Exam
This schedule provides a general outline of topics to be covered in class. The actual pace of the class may be adjusted depending on student mastery of topics.
8. CLASS POLICIES
Late homework assignments will not be accepted. Late programming assignments will receive a 10-point deduction for each day the assignment is late.
Students are cautioned regarding Park College and U.S.A.S.M.A. policies regarding class attendance and academic honesty. This policy will be strictly adhered to. Three unexcused absences are defined as excessive and result in an involuntary withdrawal and a grade of F for the course. Additionally, policies regarding smoking and eating established by the college will be observed.
The final grade for the course will be assigned using the following grading scale.
Programming Assignments: 30%
Final Exam: 25%
The letter grade awarded corresponds to the following percent averages.