From asi
Computes bottom-up fixpoint iterations for recursive Datalog queries like transitive closures or graph reachability without explicit recursion. Integrates with polars dataframes.
npx claudepluginhub plurigrid/asi --plugin asiThis skill uses the workspace's default tool permissions.
Bottom-up fixpoint iteration for recursive Datalog queries without explicit recursion.
Performs Flix-based Datalog reasoning with lattice semantics and GF(3) coloring for declarative rule-based routing, lattice fixed-point computation, and deranged skill composition.
Guides Polars DataFrame usage in Python/Rust: expressions, lazy evaluation, select/filter/group/join ops, CSV/Parquet I/O for high-performance data analysis workflows.
Executes raw SQL or natural language queries against attached DuckDB databases or ad-hoc files. Manages session state, schema retrieval, and result size estimation.
Share bugs, ideas, or general feedback.
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: