Programmation en Logique
summary
Prolog programs load into SWI‑Prolog and answer queries by backtracking; the demo shows facts and rules for neighbors and transitive in relations, query holes returning X = world, and the engine producing four distinct splits for append when asking which two lists concatenate to [1,2,3]. Constraint libraries (CLP(FD)) defer numeric decisions to avoid instantiation errors, findall collects all solutions at once, and DCG grammars generate and parse sentences. Facts can be assert/retract at runtime.
AI-written summary · about
chapters (13)
- 0:00Intro
- 1:15Structure
- 1:41Who invented Logique
- 2:06Joke
- 3:33Prolog primer
- 8:03Hierarchical data
- 12:24Conditional rules
- 16:25Syntax
- 17:48Backtracking
- 22:52Practical Example
- 29:05Problems with Prolog
- 33:48How to describe grammars
- 37:32Questions
related talks
22mCan Logic Programming Be Liberated from Predicates and Backtracking? (Lightning talk)
01h 01mLearning Propositional Logic with Logic Programming
01h 34mFormal Logic Undressed
43mAn Imperishable Wonderland of Infinite Fun
15mLogic Programming with Extensible Types (Lightning talk)
52mWhat logic can teach us, Scala programmers
25mRENDEZVOUS BETWEEN FUNCTIONAL & DECLARATIVE PROGRAMMING
28mElements of Logic Programming in a Concatenative Functional Language