Artificial Intelligence

Table of contents:

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

---

1. News

• 8/5 Solutions to the Lisp assignment should be sent to Mats Cedvall (mats.cedvall@it.uu.se).
• 5/5 I think that the problems with access to assignment 4 are solved now. Let me know if it still does not work for you.
  
• 5/5 Learning as search: animal-example, sample exam with book question, answer to book question.
  
• 25/4 Notes on expert systems added
  

---

2. About this course

The Swedish name of this course is Artificiell intelligens MN1, code 1TD131.
The course counts for 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, 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

• 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.
• All occasions (except 23/3, 28/4, 19/5 and the exam) are in room 1245.
  

week	day	time	topic	who	reading	assignments
12	th	13	Room 1211 What is AI? History of AI. Course overview	RB,MC,OG	1, 17
	fr	10	Modelling AI problems as search problems	RB	3.1 + more	1. Short paper
13	tu	10	Exhaustive search methods	MC	3.0, 3.2, 4.5 (part)
	th	13	Heuristic search methods	MC	4.0-4.3
	fr	10	Search in playing games	RB	4.4
14	tu	10	lektion: search	MC		2. Implementing nim game Not Luger's version! Any prog. language.
	th	10	Logic, deduction	RB	2.1, 2.2
	fr	8	Knowledge Representation Planning and the frame problem	RB	7.0, 7.1 8.4.1, 8.4.2
16	tu	10	Lisp MrPAndMsS	MC	16
	we	15
17	tu	10					3. Transformation of predicate logic formulas to a canonical form. Implementation in Lisp.
	we	10	Expert systems, forwards/backwards chaining	RB	6.2 (part) 8.0-8.2
	fr	10	Room 1145 Match (see assignment 4 below). Nonmonotonic reasoning (abduction, default, TMS, frame)	RB	9.1	4. Implementing a small expert system in Match
18	tu	10	Learning, inspired by nature (Pdf 1.3M)	OG	parts of 11,12?
	fr	10	Learning (induction, learning as search)	RB	10 until 10.3.2, 10.6, 10.7
19	mo	15	Uncertainty, quantitative approaches	MC	9.2, 5.2, 5.4 part of 9.3?
	tu	10	Resolution, theorem proving	RB	2.3, 13.2		5. Learning
	fr	10	Constraint technology, scheduling Sudoku slides, (Other Slides, not for printing)	Pierre
20	tu	10	lektion: deduction, resolution, NMR, uncertainty	RB
	fr	10	Room 1145 Understanding natural language (parsing, KR)	MC	parts of 14
21	tu	10	AI in computer games	OG
22	tu	10	questions, course evaluation	RB, MC
	we	14.00	exam, Polacksbacken Bldg 5
August 18, 9:00			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.

Assignment 1 (now formulated)

Deadline: Friday 31 March

Assignment 2

Deadline: Tuesday 25 April

Assignment 3

Tip for assignment 3:

• Write the functions in emacs, and load them into the lisp session with

  (load "fileName")

Deadline: Monday 8 May
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: Monday 15 May
mail the .mkb files to Roland Bol. In most cases that will be enough to pass the assignment.

Assignment 5

Deadline: Monday 22 May

Exam exercises