UU/IT/Artificial Intelligence Spring 2005

Artificial Intelligence

1. News

2005-06-14 I have corrected assignment 4 now. I provide very little individual feedback, but here are some comments.
2005-06-10 The exam has been corrected. Most students have received their grades by email, but a few accounts gave problems. The exams are available at the student office.
2005-06-10 Proposed solutione to exam050530, tasks 2, 3, and 5 and tasks 1, 4 and 6.
2005-05-27 Candidate elimination example
2005-05-25 Proposed solutions to exam exercises
2005-05-23 Exam exercises.
2005-05-23 Students who have not signed up for the exam need not worry, but please let me know so that I can sign you up. Roland
2005-05-23 The deadline for assignment 5 is June 3rd.
2005-05-18, more course notes, date for re-exam, and details in assignment 4 and 5 entered.
2005-05-10 Basic idea of assignment 5 added; details will follow later.
2005-05-10 Match can now be downloaded, see under assignment 4 below.
2005-05-09 Match is now installed in lab 2315 on Pc2315-1 up to Pc2315-8. More machines follow during the week.
2005-05-09 Those of you who have written assignment 2 in Java, Prolog or Python can book time for demonstration on a list on my door. The demos will take place in my office, 1356. I have a PC that can act as a Unix terminal. Roland
2005-05-04 Assignment 4 added, but you cannot start it yet.
2005-05-03 Notes from the guest lectures by Anneli and Pierre are outside my office, 1356. Roland
2005-05-03 Those of you who have written assignment 2 in C++, lisp, or ML can book time for demonstration on a list on my door. The demos will take place in my office, 2322. Mats
2005-05-03 Please put assignment 3 in the box outside my office, 2322. Mats
2005-04-29 Prof. Larry Lucardie can't make it on May 2, he will lecture on May 16 instead. No changes are made in the schedule as such, I just moved around some of my lectures. Roland
2005-04-29 Last test example in assignment 3 corrected.

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, Anneli Edman, Larry Lucardie.

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

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

Write a short (between 0.5 and 1 page) "statement of intent" on what
you hope to learn in this course. In particular, try to pinpoint one or
two topics in AI that have your special interest - this can be
problems that have been solved (and you want to know how) or problems
that have not yet been solved (and you want to know what has been tried
and why they are difficult).

Goals
For us: to get to know our students - you are a very diverse group.
For you: to get an overview of AI, and to think about it.
"Walk around the smörgåsbord and sample some dishes."

Material: the table of contents of the course book, the first lectures,
and any other material that you find relevant.
Language: write in Swedish or English.
Deadline: Thursday 14 April, at 10 o'clock.
Handing in: email to Roland Bol, or paper in his mailbox (building 1, 4th floor, box 28) or before the lecture.
This assignment is made individually.

Assignment 2

Tip for the lisp assignment:

Write the functions in emacs, and load them into the lisp session with
```
(load "fileName")
```

Assignment 3

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.

Re-think of the administration:
mail the .mkb files to Roland Bol. In most cases that will be enough to pass the assignment.
Deadline: Thursday 19 May
The old text is below, and intentionally almost unreadable.
Examination - previous text: will be by demonstration of parts 2 and 3 during week 20.)
Deadline: Monday 16 May, at 10 o'clock - this not much time, but it's not a huge assignment and I feel that you should have used Match before Larry's guest lecture. The actual deadline will of course be your demonstration.