Introduction to Constraint Logic Programming
summary
Claims that constraint logic programming solves hard combinatorial problems with minimal code and demonstrates that concretely by using the Prolog-based ECLiPSe system, switching IC and GFD libraries, and exercising labeling/search heuristics. Demos include relational arithmetic versus is, a factorial that runs both directions, a SEND+MORE=MONEY solver, n‑queens tuned from slow to hundreds of queens with variable/value heuristics, and optimization via branch-and-bound minimize; each model runs and timings or solution counts are shown.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 0:35What is constraint logic programming
- 1:24Pros of constraint logic programming
- 3:09Cons of constraint logic programming
- 5:10Eclipse
- 5:44Libraries
- 8:28Prolog
- 16:50TPK
- 24:14Exercise
- 27:11New Variable
- 38:20Search
- 55:25Lists
related talks
45mProblem Solved! Using Logic Programming to Find Answers
41mIntroduction to Constraint Programming
34mConstraint Logic Propagation Conflict Spreadsheets
17mFixpoints for the Masses: Programming with First-Class Datalog Constraints
28mOn the Expressive Power of String Constraints
41mOptimizing Relational Programs I
24mWhen Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
23mFrom SMT to ASP: Solver-Based Approaches to Solving Datalog Synthesis-as-Rule-Se...
