CSC 550: Introduction to Artificial Intelligence

Fall 2008


11:00-12:15 TuTh
411 Old Gymnasium
Dr. David Reed
209 Old Gymnasium      x2583
DaveReed@creighton.edu



Text: Artificial Intelligence: Structures and Strategies for Complex Problem Solving (6th ed.),
George F. Luger, Addison-Wesley, 2008.


Course Description

Artificial Intelligence is the subfield of computer science concerned with automating tasks that would require "intelligence" if performed by people. AI is a highly eclectic field, with roots in mathematics, logic, psychology, philosophy, and engineering. The goal of this course is to introduce and survey the field of Artificial Intelligence, paying special attention to foundational concepts and theories. In addition, current trends and approaches in AI research will be studied.

Specific goals for the course are:


Required Work

There will be five to seven homework assignments spread throughout the term. These assignments will cover concepts and problems from class and the readings, and may involve writing and modifying AI programs in Scheme. Assignments are due before midnight on the date specified. Late assignments will receive 75% of full credit if they are handed in within one week of the specified due date. After one week, no credit will be given. In addition, students will be expected to independently research a topic in AI and present that topic to the class. There will be weekly quizzes, a midterm exam and a cumulative final exam (see the schedule below for exam dates).

Regular attendance is expected of all students. If you must miss class for a legitimate reason, it is your responsibility to make up missed work. Quizzes and Assignments will not be rescheduled except in extreme circumstances. However, the lowest quiz grade will be dropped.

It is expected that all students check their Creighton email accounts regularly. Official announcements, such as assignment revisions or class cancellations, will be distributed through Creighton email.

Grades will be determined as follows:

homework assignments 35 %
student presentation 10 %
weekly quizzes 05 %
midterm exam 20 %
(cumulative) final exam 30 %

At the minimum, traditional grading cutoffs will apply. That is, 90% is guaranteed an A, 87% is guaranteed a B+, etc. Depending on class performance, some shifting of grades (in an upward direction only) may occur as final letter grades are assigned.


Policy on Collaboration

The college policy on cheating and plagiarism is spelled out in the Student Handbook. In addition to this, the following guidelines hold for this course.

Violations of the above collaboration will be dealt with severely, with possible outcomes including failure in the course. In the case of programming assignments, you are encouraged to start early so that there is time to seek help from the instructor as the need arises.


Tentative Schedule

DATES
TOPICS
READINGS
HOMEWORK
Aug 28 Course overview, AI history. (ppt/ pdf) Chapter 1 HW1: due 9/9
Sep 2
4
AI PROGRAMMING: (ppt/ pdf)
     Scheme functions, if/cond, recursion, lists.
Chapter 15, Online
9
11
AI AS SEARCH: (ppt/ pdf)
     state spaces, uninformed strategies.
Chapter 3
16
18
Heuristic-based search: (ppt/ pdf)
     informed strategies, heuristics,
Chapter 4 HW2: due 9/25
 
23
25
     algorithm A, admissibility, A*.
Search for games: (ppt/ pdf)
Chapter 4
30
Oct 2
     game trees, minimax,
     alpha-beta pruning, game applications.
Chapter 7-8
7
9
REPRESENTATION & AI: (ppt/ pdf)
     semantic nets, frames, scripts,
Chapter 9 Presentation
HW3: due 10/31
14
16
     rule-based reasoning, expert systems.
MIDTERM EXAM
21
23
FALL BREAK - NO CLASS
28
30
MACHINE LEARNING: decision trees (ppt/ pdf)
     decision trees, ID3 algorithm,
Chapter 10
Nov 4
6
     data mining applications.
MACHINE LEARNING: neural networks (ppt/ pdf)
Chapter 11  
HW4: due 11/25
11
13
     perceptrons, learning algorithm, backpropogation,
     associative memory, Hopfield nets.
 
18
20
     NN applications.
presentation work day
Chapter 12
25
27
MACHINE LEARNING: genetic algorithms (ppt/ pdf)
THANKSGIVING BREAK - NO CLASS
Presentation/1
 
Dec 2
4
     evolutionary model, chromosomes, cross-breeding,
     mutation, GA applications.
 
HW5: due 12/12
Presentation/2
9
11
Student presentations
Course overview
 
Dec 16 FINAL EXAM    (Tue 1:00 - 2:40)

Access sample code from class