Logic Programming 06-25433 Autumn 2012

Lecture 18: Beyond Prolog: Constraint Logic Programming 2 This lecture concentrates on the most attractive of the implementation of CLP: Constraint Logic Programming over Finite Domains (CLP(FD)).

How to prepare   Revise your knowledge of the generate-and-test search technique used in the Sudoku puzzle solver (Lecture 10).

Video   Recording of the lecture (Vimeo)

Slides   If you really want the slides from the lecture ... 1 slide per page 6 slides per page but don't forget printing the slides is not the same as understanding them.

Summary   Summary and programs with commentary from the lecture

Programs from the lecture   Example 1 - game solver - using naïve generate-and-test Example 2 - game solver - using heuristics Example 3 - game solver - using CLP(FD) Example 4 - game solver - using CLP(FD) with more compact code

Individual study suggestions and further reading   Constraint Logic Programming is introduced in: Bratko. 3rd ed. Section 14.5, pp 341-345. Russell & Norvig. pp 344-345. More detailed and comprehensive introductions to Constraint Logic Programming are give in: Marriot & Stuckey. Frühwirth & Abdennader.

Assessed work associated with this lecture   Tutorial sheet 6