Introduction to Logic Programming

The course is an introduction to logic programming through Prolog. It basically follows the following book:

W. F. Clocksin and C. S. Mellish. Programming in Prolog. Fourth edition. Springer. 1994.

With each lecture the students will be given exercises involving the concepts of the lecture. At the end of the semester there will be a final written exam.

Organization

Winter Semester 2003/2004.

• Number: 326.531
• Title: Logic Programming
• Lecturer: Temur Kutsia
• Time: Wed 16:15-18:00
• Place: T 911
• Starts: October 15
• Final Exam: January 28

Contents

• Logical foundations. Introduction to Prolog programming.
• Questions, variables, conjunctions, rules, goals.
• Prolog syntax. Characters, operators, equality and matching, arithmetic.
• Using data structures. Several programming techniques on Prolog (Mapping, recursion, accumulators, difference structures).
• Backtracking, generating multiple solutions, the cut.
• Examples, debugging.
• Unification, computational model.
• Constraint logic programming.

Materials

• Book: W. F. Clocksin and C. S. Mellish. Programming in Prolog. Fourth edition. Springer. 1994.
  
• Lecture Notes:
  • Introduction - ps, pdf
  • Questions, variables, conjunctions - ps, pdf
  • Rules, goals - ps, pdf
  • Prolog syntax - ps, pdf
  • Data structures - ps, pdf
  • Mapping, recursion - ps, pdf
  • Accumulators, difference structures - ps, pdf
  • Backtracking, the cut - ps, pdf
  • Examples - ps, pdf
  • Unification - ps, pdf
  • Computational model of logic programs - ps, pdf
  • Constraint logic programming - ps, pdf
• Homeworks:
  • Homework 1
  • Homework 2
  • Homework 3. Part 1, Part 2
  • Homework 4
  • Homework 5
  • Homework 6
  • Homework 7
  • Homework 8
  • Homework 9
• Programs: chap3assembly.pl, chap3assembly-acc.pl, chap3assembly-hole.pl, bestfirst.pl.
• Programming Projects:
  1. Davis-Putnam Procedure. Project group: (max. 3 members)
  2. Propositional Semantic Tableaux Prover. Thomas Schatzl. (Sourse code and slides of final project presentation.)
  3. Mastermind Game. Matthias Rosensteiner, Bernadette Mayrhauser, Florian Gruber.
  4. Nim Game. Dorin Anculia, Roxana Stepanov, Christian Neumaier.
• Additional material:
  • M. A. Covington. Some Coding Guidelines for Prolog
  • M. A. Covington. Efficient Prolog: A Practical Guide. Research Report AI-1989-08, The University of Georgia, Athens, Georgia, 1989.
  • W. F. Clocksin. Prolog Programming (PowerPoint format).
  • J. Lloyd. Foundations of Logic Programming, second edition, 1987. Springer.
  • Open lists and difference lists. A section from Paul Brna's online Prolog book.
  • P. Y. Gloess. Constraint Logic Programming (PowerPoint format).
  • Logical foundations. Slides by Michael Boehlen .
• System: SWI-Prolog. For Windows users there is a convinient SWI-Prolog editor.
  
• Some useful on-line resourses: WWW Virtual Library: Logic programming, Prolog newsgroup.