Welcome to the Autumn 2005 Logic Programming course!

---

This page contains material for the logic programming course autumn 2005.

Click here for general information on logic programming courses

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

---

News 

• 051108 The first exam has been corrected and can be picked up at the student office (building 4). You should have received an individual (albeit not personal) email about your result. The overall result was better than previous years, and the Master's students did exactly as well as the other students.
  
• 051017 It is recommended that you check old exams before Thursday.
  
• 051017 Guest lecture slides added. Evening: Improved (smaller and coloured) constraints.pdf.
• 050930 Two labs with help on Othello are planned on 13/10 and 18/10, both from 10 to 12. Now confirmed.
  
• 050930 Corrected reference to "Hint 2" in assignment 4 - it refers to "Remark".
  
• 050928 Time and place of the exam are now available. The exam is at 8.00 at Gimogatan 4, which is on the other side of the city. In the schedule is a link to the map.
  
• 050928 Assignment 3 is corrected and can be picked up from the binder "LP HT05" in the bookshelf next to room 1346.
• 050926 This link leads to a complete book on Logic Programming. It is much better than Bratko on the theoretical issues (Herband model, etc.). The resultant tree is called SLD-tree and lacks the goal to the left of the arrow. Remember that you have limited printing quota.
  
• 050926 Assignment 4 is added.
  
• 050923 - erratum in the compendium. On page 46, the 2 lines above "Quicksort" should read:
  Answ = [a,b,c,d,e,f|Y]-Y
  X = [d,e,f|Y]
  
• 050919 - added clarification on how to hand in assignments. Note that they are handed in to Sven-Olof, not to me.  

---

Contact

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

Assistent: Sven-Olof Nyström, room 1317, phone 471 7691, mailbox 58, Sven-Olof.Nystrom@it.uu.se

Literature

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

---

Schedule

Date		Time	Room	Topic	Comp.	Bratko
week 35
We	31/8	10	1311	Prolog intro: facts, queries, answers, rules	1, 2	1
Th	1/9	8	1211	Recursive data structures and programs	3	2.1.3, 3.1, 3.2.1
week 36
Mo	5/9	10 13	1113	Lesson 1: Recursion, Prolog vs other languages Accumulators (tasks)	4.1-4.2	8.2 (8.5.4)
Tu	6/9	13	1211	Sicstus, practical issues, built-ins	15, 16	2.1.1, 2.1.2, 3.4, 7.3, 8.1, 8.3
Th	8/9	13	1515	Lab 1: Running Sicstus, list programs
week 37
Mo	12/9	10,13	1113	Lesson 2: Unification (exercise)	5	2.2, 2.7
Tu	13/9	13	1211	Logic and Logic Programming	6	1.5, 2.3, 2.4
We	14/9	13	1211	Clause and goal order, termination. List programming, data representation	4.3, 7	2.6, 3.2, 4.1, 4.2
Fr	16/9	10	1311	Search	8	2.5, 4.5, 8.5.1, 8.5.2
week 38
Mo	19/9	13	1211	Types and conversions; I/O; all solutions debugging and measurement	16.4, 16.7, 17.1, 17.2  19, 20	6, 7.1, 7.2, 7.6, 8.4
Tu	20/9	13	1515	Lab 2: I/O, debugging and measuring
Th	22/9	10,13	1113	Lesson 3: List programming. Resultant tree. Assignment 1 and 2.
Fr	23/9	8	1211	D-lists, DCG intro	9, 10.1	8.5.3, 21.1
week 39
Mo	26/9	10	1211	Mid-course evaluation, DCG applications (natural language)	10	21.2, 21.3
We	28/9	13	1211	Cut, negation	11	5, 7.5, 8.5.4
Fr	30/9	10,13	1113	Lesson 4: Search. Assignment 3. Cut and resultant tree (exam 030311 question 6)
week 40
Mo	3/10	13	1211	Searching in graphs	12	11
Tu	4/10	13	1211	Playing games	13	22
Th	6/10	13	1211	Lesson 5: DCGs, Assignment 4. Othello
Fr	7/10	10	1211	Implementation of LP (Kostis Sagonas) Slides: (pdf) (ps)	18	-
week 41
Mo	10/10	13	1211	Interpreters	14	4.3, 23
We	12/10	13	1211	Prolog on the Web + Knowledge Representation	link + link	a little of 15-20
Th	13/10	10	1515	Lab3: working on Othello
Fr	14/10	10	1311	Constraint (logic) programming (Magnus Ågren) Notes (ps 1.6M) (pdf 0.5M).	-	14
week 42
Tu	18/10	10	1515	Lab4: working on Othello
Th	20/10	10	1211	Lesson 6: Questions, old exams, course evaluation
Exams
Mo	24/10	8-13		Exam Gimogatan 4, room 2 (Map The exam hall is on the topmost detail map.)
	Jan			Exam
	Aug			Exam

Assignments

Name	Begin	Deadline	Feedback	Comments
1. Basic Logic Programming	1/9	12/9 at 10	16/9	This assignment is not obligatory. It is recommended that you do it individually.
2. Theory	12/9	19/9 at 13	22/9	This assignment is not obligatory, but can give bonus points if you do it individually.
3. Efficient problem solving - search and measurement	19/9	26/9 at 13	30/9	This assignment is not obligatory, but can give bonus points if you do it in a pair (or individually).
4. DCGs	26/9	3/10 at 13	6/10	This assignment is not obligatory, but can give bonus points if you do it in a pair (or individually).
5. Game playing (Othello)	6/10	28/10 at 15	3/11	This assignment is obligatory. You must do it in a pair (recommended) or individually.
possible rework of 5.	3/11	11/11 at 15	18/11

You may write in English or Swedish. Note the requirements on assignments.
Assignments can be handed in to Sven-Olof Nyström, or put in his mailbox, or handed in before class.
If you must send it by email, please send only files in text format (.pl or .txt).

Bonus points are only awarded for assignments that are handed in before the deadline.
Corrected assignments will be placed in a binder on the shelves next to room 1346.

Students from previous years who passed the exam and the Othello assignment can claim completion of the course without completing the other assignments, since they are no longer obligatory.

Grading

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

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

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