Artificial Intelligence

Table of contents:

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

---

1. News

• Note that the exam on 18/8 is at Ekonomikum, room A153
  
• 18/6 The exam is corrected. Solutions. Assignments 1-4 are now corrected. Assignment 5 is next.
• Note that the results of the assignments are recorded in Studentportalen under Progress (Framsteg). You need to login first to see it.
   
  

---

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.
  The 6th edition can be used - except section 9.3 and chapter 13 it is identical to the 5th edition.
  The 6th edition has no chapter on LISP (chapter 16 in the 5th edition). Chapter 17 in the 5th edition corresponds to chapter 16 in the 6th edition.
  
• "lektion" is the Swedish word for an interactive problem-solving session, where no new material is presented.
• All meetings are scheduled in room 1211
  

week	day	time	topic	who	reading	assignments
12	fr 20	13	What is AI? History of AI. Course overview	RB,MC	1, 17	1. Short paper
13	tu 24	10	Modelling AI problems as search problems	RB	3.1 + more
	fr 27	10	Exhaustive search methods	MC	3.0, 3.2, 4.5 (part)
14	tu 31	13	Heuristic search methods	MC	4.0-4.3
	we 1	15	Search in playing games	RB	4.4
	th 2	10	lektion: search Mats' lesson	MC/RB		2. Game program
17	mo 20	15	summary of assignment 1 Logic, deduction	RB	2.1, 2.2
	tu 21	13	Lisp MrPAndMsS nand-example from lecture	MC	16
	we 22	10
18	tu 28	10	cancelled				3. Transformation of predicate logic formulas to a canonical form. Implementation in Lisp.
	we 29	13	Knowledge Representation Planning and the frame problem	RB	7.0, 7.1 8.4.1, 8.4.2
19	mo 4	10	Expert systems, forwards/backwards chaining	RB	6.2 (part) 8.0-8.2
	tu 5	10	Lisp, third lecture, replacing 28/4 midcourse evaluation	MC
	we 6	8	Match (see assignment 4 below). Nonmonotonic reasoning (abduction, default, TMS, frame)	RB	9.1	4. Implementing a small expert system in Match
	th 7	10	Learning, inspired by nature (Pdf 1.4M)	OG	parts of 11,12?
	th 7	13	Genetic Algorithms and their applications in Bioinformatics	Ugur  Sezerman, Sabanci Univ. Istanbul  -- 12.1
20	mo 11	10	Learning (induction, learning as search)	RB	10 until 10.3.2, 10.6, 10.7
	tu 12	13	Uncertainty, quantitative approaches	MC	9.2, 5.2, 5.4 part of 9.3?
	th 14	13	Resolution, theorem proving	RB	2.3, 13.2		5. Flock behaviour in Netlogo.
21	mo 18	10	lektion: deduction, resolution, NMR, uncertainty	RB
	tu 19	13	Understanding natural language (parsing, KR)	MC	parts of 14
22	mo 25	10	Constraint technology slides 1-86 shown in class	Pierre F
	tu 26	13	AI in computer games	OG
	fr 29	10	questions, solutions, course evaluation	RB, MC
23	mo 1	14-19	exam Gimogatan 4, room 1
August  18		8-13	re-exam, Ekonomikum, room A153.
October January			re-exam if required, in conjunction with the exam of the new 5 cr. AI course

Sample exam (June 2007). Solution.
Sample exam (May 2008). 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: Wednesday 1 April at 15.  This assignment is made individually.

Assignment 2

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

Assignment 3

Deadline: Tuesday 12 May at 13.  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 25 May at 10
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: Friday 5 June