Artificial Intelligence

Table of contents:

1. News
2. About this course
3. Schedule and reading
4. Assignments, exams, grades

---

1. News

• 080609. The exam has been corrected and the results reported. You can pick up the exam at the student desk in Building 4. The exam with answers.
  
• 080530 The course evaluation system is down because of a hardware problem. Expected repair: during Monday.
  
• Results for assignment 2 are put in Studentportalen. If you have work pending, you or your lab partner have received an email about it.
  
• The course evaluation is open!
  
• Slides for "Constraint Technology" updated to this year's version.
  
• Slides for "AI in games" updated to this year's version.
  
• Now there are two sample exams with (partial) solutions available. See below the schedule.
  
• Lecture 1 is always an improvisation. The notes are now adapted to this year's outcome (except that I want to draw the mindmap later).
  
• 10/4 Copies of Luger (5th ed.) are available at Studentbokhandeln.
  The Table of Contents and Chapter 1 are available online (through Luger's homepage).
• Now all meetings have been moved to a larger lecture hall. (The schedule below is updated.)
  
• 4/4 This page is updated. Links for lectures refer to 2007 material - small changes will occur.
  

---

2. About this course

The Swedish name of this course is Artificiell intelligens, code 1DL019.
The course counts for 7.5 ECTS credits. The course plan is here.
The course page in Studentportalen.

Teaching staff

	Name	E-mail	Room	Phone
Lecturer	Roland Bol	Roland.Bol@it.uu.se	1356	018-471 7606
Lecturer	Mats Cedvall	Mats.Cedvall@it.uu.se	2322	018-471 1029 018-471 2973

Guest lecturers

Olle Gällmo, Pierre Flener.

Course start

• Students who have been accepted (antagen) to the course and exchange students will be registered at the first lecture. It is also possible to register through Studentportalen.
• The course will be given in English. Assignments may be handed in in English or Swedish.

---

3. Schedule and reading

• Reading refers to "Artificial Intelligence" by George Luger, 5th edition.
  The 4th edition can be used, compared to the 5th edition it lacks chapter 5, so subtract 1 from all chapter numbers above 5.
• "lektion" is the Swedish word for an interactive problem-solving session, where no new material is presented.

week	day	time	room	topic	who	reading	assignments
15	tu 8	10	1211	What is AI? History of AI. Course overview	RB,MC,OG	1, 17	1. Short paper
	we 9	13	2446	Modelling AI problems as search problems	RB	3.1 + more
	fr 11	13	2347	Exhaustive search methods	MC	3.0, 3.2, 4.5 (part)
16	mo 14	13	1111	Heuristic search methods	MC	4.0-4.3
	th 17	8	1211	Search in playing games	RB	4.4
	fr 18	13	1111	lektion: search	MC/RB		2. Game program
17	mo 21	10	2247	summary of assignment 1 Logic, deduction	RB	2.1, 2.2
	tu 22	10	2247	Lisp MrPAndMsS	MC	16
	we 23	10	2247
	fr 25	13	2146					3. Transformation of predicate logic formulas to a canonical form. Implementation in Lisp.
18	tu 29	10	2247	Knowledge Representation Planning and the frame problem	RB	7.0, 7.1 8.4.1, 8.4.2
19	mo 5	8	1211	Expert systems, forwards/backwards chaining	RB	6.2 (part) 8.0-8.2
	we 7	10	1311	Match (see assignment 4 below). midcourse evaluation Nonmonotonic reasoning (abduction, default, TMS, frame)	RB	9.1
	fr 9	8	1211	Learning, inspired by nature (Pdf 1.3M)	OG	parts of 11,12?	4. Implementing a small expert system in Match
20	mo 12	10	2247	Learning (induction, learning as search)	RB	10 until 10.3.2, 10.6, 10.7
	we 14	10	2247	Uncertainty, quantitative approaches	MC	9.2, 5.2, 5.4 part of 9.3?
	fr 16	8	1211	Resolution, theorem proving	RB	2.3, 13.2		5. Flock behaviour in Netlogo.
21	mo 19	10	1311	lektion: deduction, resolution, NMR, uncertainty	RB
	th 22	13	2247	Understanding natural language (parsing, KR)	MC	parts of 14
	fr 23	10	1311	Constraint technology	Pierre F
22	mo 26	13	1211	AI in computer games	OG
	tu 27	10	1311	questions, solutions, course evaluation	RB, MC
	th 29	8:00		exam - Polacksbacken bldg 5
August	tu 19	8:00		re-exam Polacksbacken bldg 5
January				re-exam

Sample exam (June 2007).
Solution.

Older sample exam.
The older exam is less representative, as it focuses too much on mechanical skills ("run the algorithm").
There will still be a few such questions, but there will be more "explanatory" questions, as in the June 2007 exam.
This exam was never a real exam, so it also contains more questions than an actual exam.
Solution.
There is an inconsistency in the numbering of the answers: 5,6,4 should be 4,5,8.
For question 5, see this solution. For answers to questions 6, 7 and 9 see the book).

4. Assignments, exams, grades

There are 5 obligatory assignments, as listed in the schedule. Detailed instructions for each assignment will follow.
Assignments will be graded pass/completion/fail only. The grade for the course will be determined by the exam grade.
Passing the exam gives 4 study points (6 ECTS), the assignments 1 study point (1.5 ECTS).

Assignment 1

Deadline: Thursday 17 April at 17.  This assignment is made individually.

Assignment 2

Deadline: Monday 5 May at 17.  You are allowed and encouraged to work in pairs.

Assignment 3

Deadline: Thursday 15 May at 17.  You are allowed and encouraged to work in pairs.
Solutions should be sent to Mats Cedvall (mats.cedvall@it.uu.se).

Assignment 4

Assignment 4 uses the tool Match.  If you take the course, you can dowload Match from the File Area in Studentportalen.

You are allowed and encouraged to work in pairs.

Deadline: Monday 26 May at 12
mail the .mkb files to Roland Bol.

Assignment 5

You are allowed and encouraged to work in pairs.
Mail the report (and possibly netlogo file) to Roland Bol
Deadline: Thursday 5 June