Foundations of Logic Programming

The course will deal with the theoretical foundations of one of the major paradigms of programming, logic programming. This is a different approach to programming than the one known from object-oriented and functional programming languages. We will analyze what mechanisms are used by logic programming and prove their correctness. Abundance of examples will be provided at this course and at the parallel courses: Logic Programming Engineering and Constraint Programming as well.
Prerequisites: Basic notions from the first order logic.

The lecture takes place every week in room E05: Wednesday 13:00–14:30


Announcements:

• List of students that get a 30% advantage on the final exam in FLP
• Exam is on 08.02.2013, 10:00 - 12:00, in room: INF-E009.
• Exam (2nd chance!) is on 22.07.2013, 10 - 12:00, in room: INF-E005.

SWS: 2/1/–

This course is part of LCP module (Basic)

1. flights1.pl,flights2.pl,member.pl,squares.pl,append.pl,
2. Slide1
3. Slide2, Slide3
4. Slide4, Slide5
5. The main theorems, lemmas and statements proved up to now (updated!)
6. Definitions

An exercise session will be held every other week on Fridays 9:20–10:50 in room E05.

Exercise sheets will be available here approximately one week before the session.

• Assignment 1 (corrected version) with the deadline: 24.10.2012, 1:00PM
• Assignment 2 with the deadline: 7.11.2012, 1:00PM
• Assignment 3 with the deadline: 23.11.2012, 9:20AM
• Assignment 4 with the deadline: 19.12.2012, 1:00PM
• Assignment 5 with the deadline: 21.12.2012, 9:20AM
• Assignment 6 with the deadline: 18.1.2013, 9:20AM
• Assignment 7 with the deadline: 1.2.2013, 9:20AM

• Krzysztof R. Apt. From Logic Programming to Prolog. Prentice Hall 1997