Syllabus for CS3310 (4-1), Artificial Intelligence, Spring 2003

Course goals

Survey of the main techniques of artificial intelligence, especially knowledge representation, inference, control structures, uncertainty, heuristic search, and learning.� The emphasis is on methods for achieving intelligent behavior in computers, not necessarily modeling human behavior.� A variety of skills will be covered, including programming, simulation of programs on paper, knowledge of key terms, and ability to discuss in writing the application of artificial-intelligence methods to real-world problems.� The ultimate goal is to enable students to write programs exhibiting intelligent behavior.

Prerequisites

The official prerequisite for this course is CS3010 and one college-level course in programming.� It is also helpful to have some knowledge of logic, further programming experience, and some knowledge of data structures.

�

Grading

Homework 1, 60 points

Test 1, 100 points

Homework 2, 60 points

Test 2, 100 points

Homework 3, 45 points

Test 3 (during exam week), 100 points

Tests are open-book; expected class averages on tests will be around 80%.� Questions will emphasize thinking more than memorization.� Lately the grades have been approximately 35% A, 35% A-, 25% B+, and 5% less than B+.

Many test questions will relate to homework problems.� Some homework will be team problems, and some will be individual.� Individual problems must be done by each student on their own without consulting other students.� The late penalty is 10% after the due time on the due date, but no homework is accepted after solutions are handed out.

Submitted homework should be on paper.� It should be stapled together with the problems in consecutive order, and all the material for a problem together without appendices.� Do not use paper clips or binders.� Put a paper cover on the homework submission.� Write your name in the upper right corner of the first page.

Textbook and materials

Required textbook is Luger, Artificial Intelligence, 4th edition, Addison-Wesley.� Useful additional references are Rowe, Artificial Intelligence through Prolog (on Web at www.cs.nps.navy.mil/people /faculty/rowe/book/book.html), Russell and Norvig, Artificial Intelligence, Prentice-Hall; and Winston, Artificial Intelligence, Addison-Wesley.� Copies of the PowerPoint slides used in class will be handed out and are available at the Web site www.cs.nps.navy.mil/people/faculty/rowe/coursematerials.

This site will also contain downloads necessary for the class.

The scheduled lab hour will not be used except for makeup classes; you do the labs as part of the homework at your own pace.� Some of the homework questions will require the language Prolog that you download using the instructions given with the first assignment.� The other programming will be in Java or C++ (your choice).

Instructor

Prof. Neil Rowe (Spanagel 514, x2462, ncrowe@nps.navy.mil).� Official office hours: Monday-Thursday 900-1200 (but unofficially, you can interrupt him anytime he's not talking to someone else).� Email is not answered on weekends.

CS3310 example schedule for Spring 2003 (readings are in Luger)

By 4/7: Overview of AI: read chapter 1 and the introduction to chapter 2 (through page 46)

By 4/14: Knowledge representation: Read sections 6.2, 14.0, 14.1.1, 14.1.2, 7.3.3

By 4/21: Inference rules: Read chapter 2

Homework #1 due Tuesday, 4/22 in class

Test #1: Thursday 4/24

By 5/1: List processing: Read sections 14.1.3, 14.1.4, 14.1.5

By 5/8: Control structures: Read sections 7.1 and 7.2

By 5/15: Reasoning with uncertainty: Read sections 8.0, 8.2.1, 8.2.2, 8.3, 10.0, 10.1, 10.2

Homework #2 due Tuesday, 5/20 in class

Test #2: Thursday, 5/22, covering material since Test #1

By 5/29: Heuristic search: Read sections 3.0, 3.1, 3.2, 4.0, 4.1

By 6/5: Planning and search strategies: Read sections 4.3, 4.4

By 6/12: Machine learning: Read sections 7.4.1, 7.4.2, 9.0, 9.1

Homework #3 due Monday, 6/16 at 1500

Test #3: probably Tuesday 6/17, covering mostly material since Test #2, date, time, and location to be determined