DM22, Spring 2006 - Weekly Note 13

Note: this week, exercises and lectures will swap place (i.e. exercises Tuesday, lectures Wednesday).

Imada Announcements

There will be a "Pizza-Meeting" for all students of Imada on Thursday, May 18 at 16.00-18.30 in room U49. At the meeting Imada will give general information on the Bachelor and Candidate studies, and specific information on the elective courses in Mathematics and Computer Science planned for the next semester. The meeting will end with a free pizza, beer, and soft drink session.

Instruktorater: Hjælp dine medstuderende, dygtiggør dig selv og få penge for det. Søg i dag! Der er normalt relativt få ansøgere, så det er ofte muligt at få et instruktorat, selv om man ikke er langt i studiet. Hvis du har spørgsmål, så henvend dig gerne på IMADA. Ansøgningsproceduren er beskrevet på www.jobs.sdu.dk. Hvis du allerede er ansat som instruktor i efteråret 2006, leverer du ansøgning om tildeling af timer ind på IMADA's sekretariat (se opslaget omkring bilag mm.). Ansøgningsfrist: 24. maj 2006 kl. 12:00.

Lecture May 10

Even further prolog examples and built-in predicates.

Reading

Chapter 5, Rest of Chapter 6, Sections 7.2, 7.5, and 7.7-8. Slides: txt, txt.

Comments

We have covered approximately half of Chapter 7. The rest also contains very interesting examples of Prolog programming, which are left for reading on your own. Sections 8.1-2 on layout and common errors are also left for reading on your own.

Lecture May 17 (Expected contents)

Tracing. Prolog and logic.

Reading

Sectiions 8.3-4 and Chapter 10 in Clocksin and Mellish.

Comments

The textbook is a bit vague in Chapter 10 (except for the algorithm for conversion to clausal form in Section 10.2). For the interested, a more precise account of the subject can be found in Chapters 1-3 in Ulf Nilsson, Jan Maluszynski: Logic, Programming and Prolog, 2nd edition, Wiley, 1995 (Sections 2.3-4 can be omitted). The book is out of print, but is available online at http://www.ida.liu.se/~ulfni/lpp/. Note that Horn clauses are termed definite clauses in this book.

Exercises May 16

Exercises 4.1, 7.5-6, and 7.8 in Clocksin and Mellish.

Exam of summer 2002 (pdf), exercise 1 (for the "call", "redo", etc. terminology of the box execution model, see Section 8.3 of Clocksin and Mellish).

Exam of summer 2002 (pdf), exercise 2, question b.

Exam of winter 2000 (pdf), exercise 4 (a "hole" is a variable which is set sharing with other variables during the recursion, with the common value only instantiated later (e.g. at the end of the recursion)).