Datalog bottom-up fixpoint iteration for recursive queries
/plugin marketplace add plurigrid/asi/plugin install asi-skills@asi-skillsThis skill inherits all available tools. When active, it can use any tool Claude has access to.
Bottom-up fixpoint iteration for recursive Datalog queries without explicit recursion.
Datalog computes fixpoints via iterative saturation:
T^0(∅) → T^1 → T^2 → ... → T^ω (fixpoint)
Where T is the immediate consequence operator.
This skill connects to the K-Dense-AI/claude-scientific-skills ecosystem:
algorithms: 19 citations in bib.duckdbFixpoint computation maps to Cat# via coalgebraic semantics:
Trit: 0 (ERGODIC - iterative bridge)
Home: Prof (profunctors/bimodules)
Poly Op: ⊗ (parallel saturation)
Kan Role: Adj (Kleisli adjunction)
Datalog fixpoint iteration is inherently ERGODIC:
This skill should be used when the user asks to "create a hookify rule", "write a hook rule", "configure hookify", "add a hookify rule", or needs guidance on hookify rule syntax and patterns.
Create distinctive, production-grade frontend interfaces with high design quality. Use this skill when the user asks to build web components, pages, or applications. Generates creative, polished code that avoids generic AI aesthetics.