Finite-Choice Logic Programming

on YouTube ↗20m

" summary

Defines a new semantics that replaces negation with explicit choices, formalizes rules as functions from databases to choice sets, and proves a least-fixed-point semantics over choice sets that generalizes stable models and avoids unjustified reachability inferences. Presents a decision procedure and an algorithm that is proven correct, plus a web-accessible Dusa implementation in JavaScript that compares favorably to Clingo and can enumerate infinite solution spaces (stop‑and‑go example) without full grounding.

AI-written summary · about

" chapters (10)

1. 0:00Finite-choice logic intro
2. 2:45SAT and Datalog limits
3. 3:49Finite-choice logic intro
4. 5:12Encoding constraints
5. 6:36Semantics of programs
6. 8:00Choice sets and lattice
7. 9:43Ordering in choice sets
8. 11:52Comparison with answer set programming
9. 13:15Infinite spaces handling
10. 15:03Conclusion and future