Contents of the lectures (or what was there last time)
and planned contents of future lectures

Lecture 1 (22/9)
    Introduction (slides "Introduction")
    Theory of basic LP (slides on Definite programs, until u-derivations)

Lecture 2 (29/9)
    Theory of basic LP (slides on Definite programs)
    Introduction to Prolog (1/2 of the slides on Prolog)
    Programs
         map_colour0.pl
         lists.pl  (part)
         compil.rp.pl

Lecture 3 (4/10)
    Introduction to Prolog (ctnd.) and example programs
         lists.pl  (continued)

Lecture 4 (11/10)
    Introduction to Prolog (ctnd.) and example programs   
      Built-in predicates
      Prolog arithmetics
      The cut

Lecture 5 (18/10)
      The cut
      Example programs - sorting
      Difference lists
      Proving program correctness and completeness
      Incorrectness diagnosis

Lecture 6 (25/10)
      Incompleteness diagnosis
      Proving termination
      Negation in LP - introduction      
      Constraint Logic Programming - the first part of the slides

Lecture 7 (1/11)
      Constraint Logic Programming - cont'd
      Programs
          multip.puzzle.fd.pl
          queens.clpfd.pl

      More on Prolog built-ins
          execution profiling
          Prolog "strings"
          modifying the selection rule
          modifying the program

Lecture 8 (8/11)
      Metaprogramming
           meta-int.AoP.program-17.5.pl
           proof.trees.AoP.program-17.8.pl
      Homeworks
          append4.pl
      DCG
           dcg.AoP.program-19.9.pl
      Efficient implementation of arrays
           array.pl, knight3.pl, knight4.pl
      Constructing an efficient program
           sat.construction.summary.pl, sat.construction.pl, sat.pl, 
           paper "Logic + control: An example of program construction"

Lecture 9 (15/11)
      Brief summary of the construction from the last lecture
           sat.construction.summary.pl
      Metaprogramming, built-in call/[2..]
          meta-map.pl
      Comments/solutions to home assignments.   Hw1.4, hw2.1, hw4.3.

      Negation in LP
        CWA vs NAF, 
        completion semantics, the well-founded semantics
          trClosure.pl

Lecture 10 (18/11)
      Negation in LP - stable model semantics