Introduction to constraint programming
summary
Constraint programming is presented as a practical way to solve problems like Sudoku, conference scheduling, and the traveling salesman type routing for a salesperson using a constraint solver. The talk explains basic constraint programming concepts and demonstrates them with several well-known example problems, then concludes with a more complex real-world case the presenter is working on, with slides and example code available online.
AI-written summary · about
chapters (10)
- 0:00Introduction
- 1:08Basic definitions
- 7:26Pythagorean interactive example
- 12:29Triangle area optimization
- 14:2105 menu problem
- 16:54Sudoku solving
- 19:26Fabric cutting case study
- 24:46How solvers work
- 36:20Techniques and patterns
- 40:44Q&A
related talks
51mA.I. constraint optimization with OptaPlanner
30mFrom Constraints to Cognition: A Hybrid Framework for Adaptive, Explainable(…)
28mType-Driven Prompt Programming: From Typed Interfaces to a Calculus of Constraints
01h 04mInvited Talk: Finding Good Programs by Avoiding Bad Ones
56mPeople, Ideas, and the Path Ahead
31mFormalizing and Reasoning about Contracts between Agents
17mHow to Program like a Five Year Old in Haskell
29mMarketplace Logistic via Answer Set Programming