☰
↑
←
→
🔍
TOC
Constraint Logic Programming
»
Table of Contents
Table of Contents
Part I — What constraints are, and why we want them
Constraints (Slide 2)
Where this came from
A comparison with classic LP (Slides 3–5)
Herbrand terms: we have been doing constraint programming all along
Prolog arithmetic: where it breaks
Constraint arithmetic
Advantages and costs
Search space reduction, by example (Slides 6–10)
Generate and test in Prolog
The same program, with constraints
Constrain and generate
What it is worth
Exercises
Constraint systems: CLP(𝒳) (Slide 11)
The formal statement
Constraint domains (Slides 12–14)
CLP(𝒳) programs (Slide 15)
Part II — CLP(ℛ) in practice
A case study: CLP(ℛ) (Slide 16)
Exercises
Linear equations (Slide 17)
Systems of linear equations (Slide 18)
Exercises
Non-linear equations (Slide 19)
Fibonacci revisited: standard Prolog (Slide 20)
Fibonacci revisited: CLP(ℛ) (Slide 21)
Exercises
Mortgage calculation (Slides 22–23)
Exercises
Analog RLC circuits (Slides 24–28)
Part III — Puzzles, search, and finite domains
The N queens problem (Slide 29)
The N queens problem in Prolog (Slide 30)
Search space in Prolog (Slide 31)
The N queens problem in CLP(ℛ) (Slides 32–33)
What the constraints look like (Slides 34–36)
Finite domains (I) (Slide 37)
Finite domains (II) (Slide 38)
Finite domains (III): domain, labeling and minimize (Slide 39)
A classic: SEND + MORE = MONEY (Slide 40)
Exercises
A project management problem (Slides 41–42)
Two variants (Slides 43–45)
Exercises
N queens with finite domains (Slide 46)
Exercises
Part IV — Other domains, and the wider picture
CLP(𝓕𝓣), also known as logic programming (Slide 47)
CLP(𝓦𝓔) and CLP(𝓦𝓔, 𝒬) (Slides 48–49)
Summarizing (Slide 50)
Complex constraints (Slide 51)
Other primitives (Slide 52)
Implementation: satisfiability (Slide 53)
Implementation: backtracking (Slide 54)
Implementation: extensibility, and attributed variables (Slides 55–56)
Programming tips (Slide 57)
CLP systems (Slide 58)
The original systems, and the current ones (Slides 59–60)
Origins, and other instances (Slide 61)