Welcome to the Spring 2003 Logic Programming course!

This page contains material for the logic programming course spring 2003.

Click here for general information on logic programming courses

  • Free Prologs for Windows (and Linux, ...)
  • Requirements on the assignments
  • Old exams
  • Links

News 

  • The next exam is on September 1. Time and place (at Polacksbacken) will follow.
  • The August re-exam is cancelled because no student has registered for it.

  • The results of the first and second exam (accessible from local machines only). You can pick up the exams at the student office.
    Important notice: I waive the completions of assignment 2 and 3 for those who passed the exam. You still have to complete Othello, of course.
    For those who did not pass the exam: use the completions as practice before the re-exam.

  • The exam and facit. (now complete)

  • Kostis' slides (pdf).
  • After the lecture on Wednesday 26/2 there will be a general question hour.
  • Deadline extension: the deadline for assignment 3 is now Friday 28/2 at 10:15. Hard deadline!
  • 18/2: assignment 3 added.

  • Who will correct my assignment?
  • Plan for the lesson of 14/2:
    1. Assignment 2: questions, clarifications and some hints
    2. Assignment 1: questions; a look at parts C.3 and C.4.
    3. Semantics: Part C from an assignment from 2002.
    4. Cuts

  • Corrected assignments will be placed in a binder on the shelves next to toom 1346. Assignment 1 should be there some time on Monday.
  • 6/2, The lessons on 7/2 will focus on sections 7.3 and 8.1 of the compendium - analysing and understanding the program in several ways, in particular by drawing a resultant tree. Unification will come in by necessity. Some time will be spent on assignment 1, and there will be time for general questions. There is no prescribed devision between the two groups - come when you like.

  • 6/2, Answers and comments for assignment 1 added.
  • 6/2, office hours of the assistants added.
  • 4/2, assignment 2 is now completely available.
  • 20/1, assignment 1 added.
  • This page was created on January 15. Please report any errors to Roland Bol.

Contact

Lecturer: Roland Bol, room 1356, phone 471 7606, Roland.Bol@it.uu.se.

Assistents:

Literature

  • Prolog, Programming for Artifical Intelligence by Ivan Bratko. 3rd edition, Addison Wesley, 2001.
  • Compendium, sold at UTH-gård for 80 kr.

Schedule

Lectures are in room 1211 (except 18/2 in 1311).
Labs are in 1515. Lessons (lektioner) are in 1245.

Date Time Topic Comp. Bratko
week 4
Mo 20/1 8 Prolog intro: facts, queries, answers, rules 1, 2 1
Tu 21/1 8 Recursive data structures and programs 3 2.1.3, 3.1, 3.2.1, 3.2.2
Th 23/1 8 Sicstus, practical issues, built-ins, Prolog vs other languages 17.1, 17.3-17.5,
18.1-18.3, 4 		2.1.1, 2.1.2, 3.3, 3.4, 7.1, 7.3, 8.3
Fr 24/1 13 Lab 1: Running Sicstus, list programs
week 5
Mo 27/1 13 Unification, occurs check 5 2.2, 2.7
Tu 28/1 15 resultants, clause and goal order 6 1.5, 2.3, 2.4, 2.6
We 29/1 13 Types and conversions; I/O
debugging and measurement 		17.2, "20" 6, 8.4
week 6
Mo 3/2 13 Lab 2: I/O, debugging and measuring
We 5/2 13 Programming with lists; search 7, 8.2, 8.3 3.2, 4.1, 4.2, 4.4
Fr 7/2 10/13 Lesson 1: Assignment 1. Unification. Resultant tree. 7.3, 8.1 2.5, 3.2.6
week 7
Mo 10/2 13 Search by backtracking
Logical interpretation, soundness, completeness 		8.4
9 		4.5, 8.5.1, 8.5.2, 8.5.5
Tu 11/2 15 Cut, negation 10 5, 7.5, 8.5.4
Fr 14/2 10/13 Lesson 2: Search. Semantics. Cut.
week 8
Mo 17/2 13 D-lists, DCG intro 11, 12.1 8.5.3, 21.1
Tu 18/2 13 in 1311 DCG applications (natural language) 12.2, 12.3 link 21.2, 21.3
We 19/2 13 Interpreters 15 4.3, 23
week 9
Tu 25/2 13 Searching in graphs 13 11
We 26/2 13 Playing games 14 22
Fr 28/2 10/13 Lesson 3: Assignment 2 and 3. DCGs, interpreters, Othello
week 10
Mo 3/3 13 Constraint (logic) programming (Pierre Flener) - 14
Tu 4/3 13 Prolog on the Web + Knowledge Representation link + link a little of 15-20
We 5/3 13 Implementation of LP (Kostis Sagonas) 19 -
Fr 7/3 10 Questions, old exams
Exams
Tu 11/3 9.00-14.00 Exam Polacksbacken bldg. 5
Tu
 10/6 15.00-20.00
 Exam Polacksbacken bldg. 5
Th
 7/8 09.00-14.00
 Exam cancelled
Mo
 1/9
 to be decided
 Exam Polacksbacken (room to be decided)

Assignments

You may write in English or Swedish. Note the requirements on assignments.
Assignments are done in pairs (except nr. 1). 3 is not a pair. 1 may be a pair.

If the link is dead, I have not finished writing the assignment.

Name Begin Deadline Comments
1. Basic Logic Programming 23/1 29/1 This assignment obligatory for the 5p course (incl. exchange students), but strongly recommended for all students. facit.
2. Efficient problem solving -
theory and practice 		3/2 17/2 at 13:15 This assignment is obligatory. facit.
3. DCGs and Interpreters 19/2 28/2 at 10:15 This assignment is obligatory.
4. Game playing (Othello) 26/2 17/3 at 10:00 This assignment is obligatory.

Grading

You can obtain the grades U, G, and VG
(exchange students also receive an ECTS grade from A to F).

Grading will be based mainly on the exam (90 points).
Assignments 2 and 3 together will give at most 10 bonus points.

It usually takes 45 points to pass, 70 points to get a VG.






Show printer-friendly page | Copyright © 2012 Uppsala University, Department of Information Technology.
Last updated 24 Aug 2004. Responsible: Roland Bol. Web: Contact.