Logic Programming
06-25433
Autumn 2012

 

 

 

Lecture 17: Beyond Prolog: Constraint Logic Programming 1

This lecture introduces the idea of constraints and constraint satisfaction. It shows how constraint satisfaction can be added to logic programming to form constraint logic programming languages. These languages range over a variety of domains, the lecture looking particularly at the use of CLP(R).

How to prepare

 

Try some verbal arithmetic problems (also known as cryptarithmetic problems), such as assigning values to the following letters: 


                         S E N D
                     +   M O R E
                       ---------
                     = M O N E Y
                       =========

Try some map colouring problems, e.g. colouring in the states of Australia.

Video

  Recording of the lecture (Vimeo)

Slides

  If you really want the slides from the lecture ... 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 - converting between Celsius and Fahrenheit

Individual study suggestions and further reading

 

Constraint Logic Programming is introduced in:

More detailed and comprehensive introductions to Constraint Logic Programming are give in:

Assessed work associated with this lecture

  Tutorial sheet 6