CS 5811
Advanced Artificial Intelligence

Course description:

Course topics include current topics in artificial intelligence including agent-based systems, learning, planning, use of uncertainty in problem solving, reasoning, and belief systems.
Prerequisite: CS4811

Instructor

Dr. Nilufer Onder
Office: 309 Rekhi CS Hall
Phone: (906) 487 1641
Office Hours: MWF 10:00am-11:00pm, and whenever needed.
I understand that the office hour times I list will not fit everybody's schedule. Feel free to stop by or send e-mail for questions. If you'd like you can set up an appointment by sending me an e-mail message. Make sure that you include the times you can meet.

Textbook

Artificial Intelligence: A Modern Approach Second edition by Stuart Russell and Peter Norvig Prentice Hall Series in Artificial Intelligence, 2003

Please check out the book's web site.
I will ask you to read sections from this textbook. I will also be assigning exercises from it.
This is the latest edition of the book. It came out in 2003. The new, third edition of the book will come out sometime this fall. I suggest buying or borrowing a used copy of the textbook because the new edition is due very soon.
I will be handing out extra references as we go into advanced topics.

Grading

Assignments and project	50%
Midterm exam	25%
Final exam	25%

The final grade will be calculated using a sliding scale using the percentages above.

Class attendance:

Please send me an e-mail message if you know that you are going to miss a class or if you have missed a class.

Assignments---information and policy:

All the assigments should be submitted/handed-in at or before the beginning of class on the due date. Late submissions are not accepted unless you notify me in advance. Even so, late submissions may lose points in order to maintain fairness of grading.

There will be both essay-type and programming assignments. While discussion with others is permitted and encouraged, the final work should be done individually. You are allowed to build on material supplied in the class. You are not allowed to work in groups for the assignments. The answers, comments, and programs must be the original work of the author. I will be asking for the complete list of references you have used in completing the assignment.

If copying, plagiarism, or unauthorized collaboration is suspected, the case will be turned to the Dean of Students' office with supporting evidence (see the paragraph below on "Academic Integrity").

Exams---information and policy:

Both exams will be 48 hour take home exams. I will hand out the questions on Wednesday and collect the answers on Friday.

There will be no make-up exams. In the case of very unusual circumstances (e.g., death in the family, severe illness with doctor's written note), please come to see me and we can work something out.

Collaboration or dishonesty during the exams is not acceptable and will be reported to the Dean's office (see the paragraph below on "Academic Integrity").

Academic Integrity:

If copying, plagiarism, or unauthorized collaboration is suspected, the case will be turned to the Dean of Students' office with supporting evidence. After this, the decision is made by the Dean. The procedure is explained in the MTU Academic Integrity Policy (this is required reading!). More tips and information can be found at the Dean of Students' page. The "Featured Links" on that page include a link to a 12 minute video presentation called "Academic Integrity at Michigan Tech - What Students Need to Know." Note that we have a departmental policy of reporting the suspected cases to the Department Chair's office.

Required Background

I will assume that you know Java or Lisp or C++ and can read/analyze larger code. You may choose to your implementation in any language but then you might not be able to use the supplied code. Please see me if you have concerns about the choice of a programming language. Please see me if you have concerns about the choice of a programming language.
If you'd like to know more about Lisp, below are a couple links that might be helpful. These links are examples only, you should do more searching on the web for Lisp material. I find the index of the text below very helpful because all the Lisp functions are listed.
If you think you have gaps in your background, please come and see me. I'd be happy to show you Lisp books or chapters.
• A short lisp introduction
• Online version of the complete text of Steele's Common Lisp 2nd edition. (Link from CMU)