Logic Programming

Teaching -> Logic Programming

Duration: Approximately 30 lecture hours

Prerequisites: Basic knowledge in Mathematics

Course contents:
  1. Propositional Logic
  2. First-order Logic
  3. Normal Forms
  4. Definite Logic Programs
  5. SLD-Resolution
  6. SLDNF-Resolution
  7. Prolog Programming


  • To provide a solid theoretical foundation in  Logic Programming.
  • To introduce basic Prolog programming concepts.


  • Only those who satisfy the requirement of attendance (at least 80%) at lectures are allowed to sit the end of semester examination.
  • Students who misbehave in the class and labs will be asked to leave the class. If a student  is asked to leave a class or a lab, this will count as an absence.

Recommended reading:

  • Discrete Mathematics with Applications (Third Edition), Susanna S. Epp, Brooks/Cole, 2004.
  • Symbolic Logic and Mechanical Theorem Proving, Chin-Liang Chang and Richard Char-Tung Lee. Academic Press, New York, 1997.
  • Foundations of Inductive Logic Programming, Shan-Hwei Nienhuys-Cheng, Ronald de Wolf, Springer.
  • Logic, Programming and PROLOG (Second Edition), Nilsson U and Maluszynski J 2000.
  • Prolog Programming for Artificial Intelligence, Ivan Bratko, Addison-Wesley Publishing Company.

Course Materials:

  1. Propositional Logic [4SPP]
  2. First-order Logic [4SPP]
  3. Normal Forms [4SPP]
  4. Resolution [4SPP]
  5. Subsumption Theorem and Refutation Completeness [4SPP]
  6. SLD Resolution [4SPP]
%d bloggers like this: