Linear Logic Programming
summary
Claims that replacing classical logic with linear logic makes state change and resource usage first-class and declarative and demonstrates it with an experimental Celf implementation. Examples include an in‑place bubble‑style sort implemented as a single forward‑chaining linear rule, a chess ruleset that generates random games of chess, and a narrative encoding of Madame Bovary as 35 linear logic rules that yields random story variants and extractable causality graphs. Forward and forward/backward chaining combine with non‑deterministic quiescence to model evolving local state and the examples run.
AI-written summary · about
chapters (14)
- 0:00Start
- 1:23Locally Stateful
- 3:35Locally Stateful Computation
- 5:23What Do I Mean by Logic Programming
- 7:37Path Transitivity Rule
- 17:28Examples
- 17:58Sorting
- 18:56Forward-Chaining Linear Rule
- 21:11Quiescence
- 26:44Capture Rule
- 30:23Pawn Movement
- 32:18Pawn Capture
- 34:41Computational Narratology
- 35:44Graphs of Causality
related talks
49mIntroduction to Linear Type Systems and Linear Haskell
41mWar Time Proofs and Futuristic Programs
23mCompiling to Linear Neurons
12mLanguage-Model Probabilistic Programming for Improving Autoformalization via Cycle(…)
28mSymbolic Reasoning in telecom oriented LLMs
17mSynthesizing MILP Constraints for Efficient and Robust Optimization
41mScalable Collective Inference from Richly Structured Data using Probabilistic Soft Logic (PSL)
25mLearning Formulas in Finite Variable Logics