CSci 5511: Artificial Intelligence I
Spring 2008

• Home Page
• Syllabus
• Homeworks
• Project
• Sample Exams
• Class Notes
• Lisp Info
• AI programs

• ---

• Login Required:
• Class Forum
• Submit
• Access Scores

[ Syllabus | Homeworks | Project [ Sample Exams | Class Notes | Lisp Info | AI programs ]
Login Required: [ Class Forum | Submit | Access Scores ]

Class Announcements

• Material for final exam
  The material for the final exam includes all the material we have covered in the semester, with emphasis on the material covered after the second midterm. Specifically:

  Chapter 2

  Chapter 3

  Chapter 4: 4.1 (except Memory Bounded Heuristic Search pp 101-105), 4.2, 4.3

  Chapter 5: 5.1, 5,2 up to page 144, 5.3, 5.4

  Chapter 6: 6.1, 6.2, 6.3, 6.4, 6.5

  Chapter 7: 7.1, 7.3, 7.4, 7.5

  Chapter 8: 8.1, 8.2, 8.3

  Chapter 9: 9.1, 9.2, 9.5 only up to page 300

  Chapter 10: 10.1 up to page 338, 10.6 up to page 352

  Chapter 11: 11.1, 11.2, 11.3, 11.4

  Chapter 12: 12.3

  No lisp in the exam. The exam is open book and notes, but no computers.
• May 5Due to popular demand the project will be due on Thursday May 8
  The absolute deadline [no submissions will be accepted afetr it] for submission is Friday May 9 at 9:00am. You can submit on line using submit or on paper. If you submit on line please use pdf for your report.
• May 4 Maria's office hours on May 4 from 4:00 to 5:00
  I have to be at an oral exam at 2:00, so my office hours will be moved to 4:00.
• April 27 Maria's office hours on April 28 from 2:00 to 2:30 and after 5:00
  
• April 24 Solution for Shakey's problem
  The solution to Shakey's problem from last week exercise is posted. if you submitted answers to the bonus question, you'll get back comments from me. The bonus points for this questions are not yet posted in grit.
• April 22 Another bonus opportunity with blocks
  I announced in class a bonus opportunity if you complete the problem we discussed in class. Please return your answers to me before next class on Thursday. Here is the problem:
  You are given a number of blocks on a table. Assume, as tradionally done in the block world, that you can move a single block at a time and that there is enough space on the table to place as many blocks as needed. You can stack blocks on top of each other. When you pick up a block, you can only pick up the block on the top of the stack.
  Write using a STRIPS-like notation, if possible, a single operator schema to move a block. If this is not possible, what would you need to add to the representation language? Keep in mind that your operator schema has to work for many different situations, not just for the example we did in class. The textbook gives you a solution using two operator schemas.
• April 17 Homework 4 ready
  Homework #4 is ready.
• April 17 Plan C
  Graduate students who want to use their class project for plan C, please let me know so we can schedule a presentation of your project.
• April 17 Bonus opportunity with Shakey
  You can obtain a bonus (of up to 1%) of the final score if you answer completely the exercise we did in class today. The bonus is in addition to the score you'll get for the in class exercise. Email me your answers by Monday morning.
• April 15 Class notes
  The notes of Baylor lecture on situation calculus are available.
• April 13 Hw4 due date extended to April 29
  The due date for Homework 4 is postponed by a week to April 29. This extension is meant to allow inclusion of material on planning in the homework, which will help preparing for the final exam.
• April 13 Maria's office hours on Monday postponed to 4:30
  I have an exam, so my office hours on Monday April 14 will be from 4:30 to 5:30.
• April 6 Solution for exercise done in class on April 3
  If you are not sure about your answer to the exercise done in class on April 3 look at how to prove that Scrooge is not a child.
• April 5 Material for Second Midterm
  The material covered in the second midterm next week includes Chapter 5, Chapter 6, Chapter 7 (except 7.6, 7.7), Chapter 8 (except 8.4) and Chapter 9 (except 9.3 and 9.4.). No lisp in this exam. The exam is open book and notes, but no computers.
  In preparation for the exam, you can find practice on problems listed in the class notes.
• April 2 Answers to practice questions in predicate calculus
  Baylor has prepared answers to the practice questions in predicate calculus questions done in class last week. Enjoy!
• April 1Undergraduate scholarships
  Applications are now being accepted for CSE undergraduate scholarships. The deadline for submitting applications is April 14. To apply and for specific criteria for all available scholarships, please visit CSE Undergraduate Scholarships.
• March 12 Homework 3 finalized
  Homework #3 has been finalized.
• February 26 Midterm graded
  The first midterm has been graded and returned. As I mentioned in class I added the scores assuming the total was 100 instead of 75. You have to subtract 25 points from your score. The grades in grit have been updated to reflect the change. Sorry for the mistake.
• February 23 Homework 2 posted
  Homework #2 is due Tuesday March 4. The question for the graduate students has been replaced, since the question I had was used in an old exam. Sorry for the inconvenience.
• February 21 Upcoming Talk
  David E. Goldberg, a leader in GAs from the University of Illinois at Urbana-Champaign, will talk on " Not Your Grandmother's Genetic Algorithm", Tuesday, March 4 from 12:30 to 1:30 in Moos Tower 2-530.
• February 20 Project requirements posted
  Information on the project has been posted. The first part is due is due Tuesday March 25.
• February 13 Material for First Midterm
  The material covered in the exam includes Chapter 2, Chapter 3, and Section 4.1 and 4.2 (except Memory Bounded Heuristic Search pp 101-105) from Chapter 4. In addition you need to know how to write simple Lisp functions. The exam is open book and notes, but no computers.
• February 13 HW 1 grades posted
  Homework 1 and in-class exercise 3 grades have been posted. Please check your grades. A handful of students did not turn in part of the homework, resulting in quite low grades. If you had this problem, it will be noted in GRIT, so please check. If the missing work is because it was submitted in the wrong way/to the wrong place, please let baylor know.
• February 5 Solution to in class exercise of January 31
  Since the complete solution to the in class exercise we did on January 31 (use uniform cost search to find path from Arad to Bucharest, using map from Figure 3.2) is long, you can find a solution here
• January 28 Homework 1 posted
  Homework #1 is due Tuesday February 5. Keep in mind that this is the only homework you'll do before the first midterm, so working on it will help you doing well in the exam. A key for the homework will be distributed a week after the homework is due.
• January 22 Plan C
  Graduate students can use their class project for a Plan C. The project counts as a 50 hours project. For Plan C the project has to be done alone and a short presentation in class is required.
• January 22 Reading from Sokolowski
  I have scanned the 3 pages we read in class from Sokolowski's paper.
• November 28 Page set up
  The links do not work, but some preliminary information is available. Material will be added soon.

Lectures

Room:

MechE 212

Time:

Tuesday and Thursday 4:00pm-5:15pm

Instructor:

Dr. Maria Gini (gini at cs.umn.edu)
office hours: Monday 2:00-3:00 and Wednesday 10:00-11:00 or by appointment in EE/CSci 5-213, (612) 625-5582.
Address: 4-192 EE/CSci Building, 200 Union St. SE, Mpls, MN 55455

Teaching Assistant:

Baylor Wetzel (wetz0025 at umn.edu)
office hours: Tuesday and Thursday 2:30-3:30 in EE/CS 2-209

Textbook:

Stuart Russell and Peter Norvig "Artificial Intelligence. A modern approach. 2nd Edition", Prentice-Hall, 2003. (Chapters 1-11).

You'll need reference material on Lisp. Here are some choices:

Lamkins, Successful Lisp: How to Understand and Use Common Lisp, bookfix.com, 2004.
Graham, ANSI Common Lisp, Prentice Hall, 1996
More to come.