☰
↑
←
→
🔍
TOC
Constraint Logic Programming
»
Table of Contents
ON THIS PAGE
Constraints
A comparison with classic LP (I)
A Comparison with classic LP (II)
A Comparison with classic LP (III)
Example of Search Space Reduction
Example of Search Space Reduction
Generate–and–test Search Tree
Example of Search Space Reduction
Constrain–and–generate Search Tree
Constraint Systems: CLP()
Constraint Domains (I)
Constraint Domains (II)
Constraint Domains (III)
CLP(X) Programs
A case study: CLP(R)
Linear Equations (CLP(R) package)
Systems of Linear Equations (CLP(R))
Non–linear Equations (CLP(R))
Fibonacci Revisited (Standard Prolog)
Fibonacci Revisited (CLP(R))
Mortgage Calculation (CLP(R))
Mortgage Calculation (CLP(R)) (II)
Analog RLC circuits (CLP(R))
Analog RLC circuits (CLP(R))
Analog RLC circuits (CLP(R))
Analog RLC circuits (CLP(R))
Analog RLC circuits (CLP(R))
The N Queens Problem
The N Queens Problem in Prolog
The N Queens Problem in Prolog - search space
The N Queens Problem in CLP(R) (in Ciao clpr syntax)
The N Queens Problem in CLP(R)
The N Queens Problem in CLP(R)
The N Queens Problem in CLP(R)
The N Queens Problem in CLP(R) – search space
Finite Domains (I)
Finite Domains (II)
Finite Domains (III)
A classic example: SEND MORE MONEY
A Project Management Problem (I)
A Project Management Problem (II)
A Project Management Problem (III)
A Project Management Problem (IV)
A Project Management Problem (V)
The N-Queens Problem Using Finite Domains (in Ciao clpfd syntax)
CLP() (a.k.a. Logic Programming)
CLP()
CLP(())
Summarizing
Complex Constraints
Other Primitives
Implementation Issues: Satisfiability
Implementation Issues: Backtracking in CLP(X)
Implementation Issues: Extensibility
Attributed Variables Example: Freeze
Programming Tips
CLP Systems
Some of the Original CLP Systems
Some Current CLP Systems
Some origins and other instances
Table of Contents