~/talk

Introduction to Constraint Logic Programming

Talkat LambdaConf 2015 · 2015-05-22..05-24· [databases]
slides:none on file

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

  1. 0:00Introduction
  2. 0:35What is constraint logic programming
  3. 1:24Pros of constraint logic programming
  4. 3:09Cons of constraint logic programming
  5. 5:10Eclipse
  6. 5:44Libraries
  7. 8:28Prolog
  8. 16:50TPK
  9. 24:14Exercise
  10. 27:11New Variable
  11. 38:20Search
  12. 55:25Lists
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.