To Be or Not To Be: Adding Integrity Constraints to stableKanren to Make a Decision
summary
Integrates ASP-style predicate (integrity) constraints into stableKanren and ships a new constraint macro plus a continuation-based updater that treats constraint bodies as emitters and verifiers, avoiding full grounding and enabling early termination. Implements compilation that turns headless clauses into verifier handlers, demonstrates on N-Queens (implicit search generating all 2^(board) combos then pruned) and graph-coloring variants, and reports a working prototype that finds stable models where previous approaches could not.
AI-written summary · about
chapters (10)
- 0:00Adding constraints to stableKanren
- 1:05Integrity constraints basics
- 5:01Limitations of stableKanren
- 10:12Stable model semantics
- 12:42Defining constraints formally
- 15:58Handling constraints approaches
- 17:12New solution for constraints
- 20:02Integrating constraints into resolution
- 21:05Solving search with constraints
- 26:44Future directions