Course schedule: Artificial Intelligence and Intelligent Systems

Course given autumn semester 2005 at Roskilde University by Henning Christiansen

Back to course home page which also explains references to literature used below (direct links included below when relevant).

The course runs on Tuesdays, 9.30-12.00 and 13.00-15.30, in Room 43-2.43 or Room 42-2.37.

Room Date Theme Reading Exercises, guidelines, etc.

43-2.43 6-sep-2005 Introduction to AI and the course
transparencies
Workshop: Logic programming in Prolog,
trans [MN] chap 1; [HC1] chap 1
Background reading: [AT] [HC1], exercise 2.1
Sample program: exercise2_1.

43-2.43 13-sep-2005 Prolog workshop continued
trans, trans, (to be used later in course trans)
Rule-based expert systems
trans.
More workshop: Constraint Handling Rules in Prolog [MN] chap 2; [HC1] chaps 2-3 minus 2.4
On CHR: [HC2] and section of manual on CHR [CHR1] (sort out what is relevant). [HC1], exercise 2.2, 5.1; look at 5.3 as homework
[HC2] Exercise 1 and perhaps 2 (p. 10)
Sample program for 2.2 circuits.

42-2.37 20-sep-2005 Fuzzy expert systems [MN] chap 4
See also [BNW] as alternative presentation of fuzzy logic and introduction to fuzzy control Driving car using fuzzy logic; exercise 1-3, perhaps 4 and 5 if time permits (6 and 7 can be taken as project proposals beyond this course).

42-2.37 27-sep-2005 Deduction, Induction, and Abduction - with special emphasis on abduction. Application of abduction to diagnosis problem [HC3], sections 1-6.
Background reading to be added. Exercises on solving abductive and diagnosis problems , exercise 1 and 2.1.
Source files: Solution to ex. 1, deductivePower (for exercise 2)

43-2.43 4-oct-2005 No teaching at RUC, but you may get some extra reading and exercises and/or assignments for this week; more info at the course 27-sep -- Continue with exercises above.
Additional exercises about Prolog
(solutions, that you are not allowed to look at before trying yourself: catsNdogs, books)

Morning: 43-2.43
Afternoon: 42-2.37 11-oct-2005 Natural language analysis with Definite Clause Grammars; abduction and assumptions
NB: Co-author of papers [HC-VD1], [HC-VD2] Veronica Dahl is expected visit us. [BBS]. (pdf document) chapters 7 and 8, minus 7.2.3 and 8.1.3.
NB: See guidelines to this reading first, DCGShortNote.pdf!!!
[HC-VD1], [HC-VD2] (minus section 4). Exercises and examples as pdf.
Source files that you will need: dcg1, dcg2, dcg3, trip.
Solutions to exercise 3 and exercise 5.

42-2.37 18-oct-2005 Uncertainty, Bayesian learning and Diagnosis supported by statistics
Powerpoint slides [MN] chapter 3, until p. 62 middle.
Critical remarks to chap. 3 of [MN]!
[HC4]: Examples and exercises for conditional probabilities and Bayesian reasoning All exercises of [HC4]

Morning: 42-2.37
Afternoon: 43-2.43 25-oct-2005 Artificial neural networks
We plan to use Powerpoint slides by Angshuman Saha

Also: We will spend some time on the written assignments, each group gives short status for their choice of topic and thoughts about solution. [MN] chap. 6, until and including 6.5; the rest of chap. 6 should be viewed as background material.
NB: You are not expected to be able to reproduce the details of the book's formulas for adjusting weights, but you should understand the overall feed-forward, back-propagation mechanism.
We will also look at one or both of two tools for building and training neural nets which you can find at http://www.geocities.com/adotsaha/NNinExcel.html, produced by Angshuman Saha; you should read this page and the explanations provided by the two tools. NB: These tools run as Excel sheets, so they should be easy to open and test. Exercises to be solved using the Excel-based tools mentioned, as pdf.

42-2.37 1-nov-2005 Evolutionary computing
slides; we used also some of MN's slides + slides.
Work with written assignments and consulting of groups [MN] chap. 7
Skip section 7.4, and be aware that there are several problematic and unclear points in this chapter; see comments.
Background reading: [KKS] (see Course home page for details); refers to interesting applications. Exercise

Morning: 43-2.43
Afternoon: 42-2.37 8-nov-2005 Consultance of students for the written assignment -- --

42-2.37 15-nov-2005 End of course: Summary and evaluation.
Presentation of written assignments by students.
Find student reports here
A few words about the exam.
Comment and discussion about the course. Schedule
9.30-10.45: 5 x 15 min's presentations
10.45-11.00: Break
11.00-12.00: 4 x 15 min's presentations
12.45-14.10: 3 x 15 + 2 x 20
14.10-14.25: Break
14.25-15.30: Few words about exam plus discussion about the course. --

42-2.37 10-jan-2006
10:00-13:00 Question-and-answer session
You should send questions or topics you want to have covered by e-mail to the course mailing list in advance, before Monday 9 jan 2006, 8:00.
If no questions are received, the session is cancelled.

43-2.29 12-jan-2006
9.00-15.50 EXAM Schedule with approximate time for each students will appear here or communicated otherwise.
There will be a slot of 30 min's for each student, including examiner's evaluation.
Examination may take about 15-20 min's, and you are expected to start with a presentation of your written assignment of perhaps 5 to 7 min's, which will be followed by a discussion. The examiners will most likely also ask a question to part of the course literature which is not directly related to your assignment.
An advice: The presentation of the assignment needs not be fancy, it's the content that matters. A possible structure could be: Which problem did I approach, how did I approach it, and what did I learn ....
Another advice: The report that you gave in for the assignment is not in itself assessed in the exam, so if you you are aware of any weak points, you need not "defend" or "repair" but you can (if you like) take these as points for discussion.
If there is any doubt, contact your teacher.

43-2.29 13-jan-2006
9.00-13.50 EXAM
Continued

Room	Date	Theme	Reading	Exercises, guidelines, etc.
43-2.43	6-sep-2005	Introduction to AI and the course transparencies Workshop: Logic programming in Prolog, trans	[MN] chap 1; [HC1] chap 1 Background reading: [AT]	[HC1], exercise 2.1 Sample program: exercise2_1.
43-2.43	13-sep-2005	Prolog workshop continued trans, trans, (to be used later in course trans) Rule-based expert systems trans. More workshop: Constraint Handling Rules in Prolog	[MN] chap 2; [HC1] chaps 2-3 minus 2.4 On CHR: [HC2] and section of manual on CHR [CHR1] (sort out what is relevant).	[HC1], exercise 2.2, 5.1; look at 5.3 as homework [HC2] Exercise 1 and perhaps 2 (p. 10) Sample program for 2.2 circuits.
42-2.37	20-sep-2005	Fuzzy expert systems	[MN] chap 4 See also [BNW] as alternative presentation of fuzzy logic and introduction to fuzzy control	Driving car using fuzzy logic; exercise 1-3, perhaps 4 and 5 if time permits (6 and 7 can be taken as project proposals beyond this course).
42-2.37	27-sep-2005	Deduction, Induction, and Abduction - with special emphasis on abduction. Application of abduction to diagnosis problem	[HC3], sections 1-6. Background reading to be added.	Exercises on solving abductive and diagnosis problems , exercise 1 and 2.1. Source files: Solution to ex. 1, deductivePower (for exercise 2)
43-2.43	4-oct-2005	No teaching at RUC, but you may get some extra reading and exercises and/or assignments for this week; more info at the course 27-sep	--	Continue with exercises above. Additional exercises about Prolog (solutions, that you are not allowed to look at before trying yourself: catsNdogs, books)
Morning: 43-2.43 Afternoon: 42-2.37	11-oct-2005	Natural language analysis with Definite Clause Grammars; abduction and assumptions NB: Co-author of papers [HC-VD1], [HC-VD2] Veronica Dahl is expected visit us.	[BBS]. (pdf document) chapters 7 and 8, minus 7.2.3 and 8.1.3. NB: See guidelines to this reading first, DCGShortNote.pdf!!! [HC-VD1], [HC-VD2] (minus section 4).	Exercises and examples as pdf. Source files that you will need: dcg1, dcg2, dcg3, trip. Solutions to exercise 3 and exercise 5.
42-2.37	18-oct-2005	Uncertainty, Bayesian learning and Diagnosis supported by statistics Powerpoint slides	[MN] chapter 3, until p. 62 middle. Critical remarks to chap. 3 of [MN]! [HC4]: Examples and exercises for conditional probabilities and Bayesian reasoning	All exercises of [HC4]
Morning: 42-2.37 Afternoon: 43-2.43	25-oct-2005	Artificial neural networks We plan to use Powerpoint slides by Angshuman Saha Also: We will spend some time on the written assignments, each group gives short status for their choice of topic and thoughts about solution.	[MN] chap. 6, until and including 6.5; the rest of chap. 6 should be viewed as background material. NB: You are not expected to be able to reproduce the details of the book's formulas for adjusting weights, but you should understand the overall feed-forward, back-propagation mechanism. We will also look at one or both of two tools for building and training neural nets which you can find at http://www.geocities.com/adotsaha/NNinExcel.html, produced by Angshuman Saha; you should read this page and the explanations provided by the two tools. NB: These tools run as Excel sheets, so they should be easy to open and test.	Exercises to be solved using the Excel-based tools mentioned, as pdf.
42-2.37	1-nov-2005	Evolutionary computing slides; we used also some of MN's slides + slides. Work with written assignments and consulting of groups	[MN] chap. 7 Skip section 7.4, and be aware that there are several problematic and unclear points in this chapter; see comments. Background reading: [KKS] (see Course home page for details); refers to interesting applications.	Exercise
Morning: 43-2.43 Afternoon: 42-2.37	8-nov-2005	Consultance of students for the written assignment	--	--
42-2.37	15-nov-2005	End of course: Summary and evaluation. Presentation of written assignments by students. Find student reports here A few words about the exam. Comment and discussion about the course.	Schedule 9.30-10.45: 5 x 15 min's presentations 10.45-11.00: Break 11.00-12.00: 4 x 15 min's presentations 12.45-14.10: 3 x 15 + 2 x 20 14.10-14.25: Break 14.25-15.30: Few words about exam plus discussion about the course.	--
42-2.37	10-jan-2006 10:00-13:00	Question-and-answer session You should send questions or topics you want to have covered by e-mail to the course mailing list in advance, before Monday 9 jan 2006, 8:00. If no questions are received, the session is cancelled.
43-2.29	12-jan-2006 9.00-15.50	EXAM	Schedule with approximate time for each students will appear here or communicated otherwise. There will be a slot of 30 min's for each student, including examiner's evaluation. Examination may take about 15-20 min's, and you are expected to start with a presentation of your written assignment of perhaps 5 to 7 min's, which will be followed by a discussion. The examiners will most likely also ask a question to part of the course literature which is not directly related to your assignment. An advice: The presentation of the assignment needs not be fancy, it's the content that matters. A possible structure could be: Which problem did I approach, how did I approach it, and what did I learn .... Another advice: The report that you gave in for the assignment is not in itself assessed in the exam, so if you you are aware of any weak points, you need not "defend" or "repair" but you can (if you like) take these as points for discussion. If there is any doubt, contact your teacher.
43-2.29	13-jan-2006 9.00-13.50	EXAM Continued

Last modification 8-jan-2006, Henning Christiansen