UU/IT/Artificial Intelligence Spring 2007

Artificial Intelligence

1. News

12/6 The first exam has been corrected, and all students have received an email with their result.
The email does not state the ECTS grade, which was set as follows (for grade X you need at least y points):
A: 35, B: 28, C: 24, D: 20, E: 18.
Exams can be picked up at the IT-office. Short solutions are here.
31/5 The course evaluation is now open. Enter through http://evaluering.ibg.uu.se/it/
28/5 Updates the guest lecturers slides.
If all goes well, I'm back on May 31 ... the surgery was cancelled, so I'm back now.
16/5 schedule change: the lecture on 25/5 about AI in games is moved to room 1211.
16/5 Assignment 5 is up.
11/5 Match for Mac now available.
2/4 Assignment 2 is now available. Let me know if you're looking for a partner: I may be able to do some match-making.
22/3 This page is under construction. Links for lectures refer to 2006 material - small changes will occur.

2. About this course

The Swedish name of this course is Artificiell intelligens MN1, code 1TD131.
The course counts for study 5 points, 7.5 ECTS credits.
The course plan is here.

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, Magnus Ågren.

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

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

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: Tuesday 3 April at 10. This assignment is made individually.

Assignment 2

Deadline: Tuesday 24 April at 10. You are allowed and encouraged to work in pairs.

Assignment 3

Deadline: 16 May. 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. In order to use Match, you must fill in and sign a non-disclosure agreement.
If you take the course, you can also dowload Match.

You are allowed and encouraged to work in pairs.

Deadline: 22 May
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: 31 May

Sample exam exercises

Compared to this exam, we are moving towards questions that test understanding of algorithms, and away from mechanical exercises (running the algorithm). At least one question will relate to a guest lecture.