Compute shortest valid hop paths between possible worlds under triangle inequality constraints.
npx skills add https://github.com/plurigrid/asi --skill world-hopping
Please help me install this Agent Skill. Skill: world-hopping Source: https://github.com/plurigrid/asi/tree/main/skills/world-hopping Command: npx skills add https://github.com/plurigrid/asi --skill world-hopping
Provides a structured approach to exploring alternative possible worlds using modal logic, event theory, and triangle inequality constraints.
Define a start world and target world, then compute a shortest valid hop path under the triangle-constraint model.
High-intent search queries and answers about installing and using this skill.
Modal logic navigation computes shortest paths between worlds by applying triangle inequality constraints to prune invalid hops. Define seed and epoch states, build accessibility relations, and use world_distance algorithms to explore valid transitions across your possibility space.
The triangle inequality constraint ensures that direct paths between worlds respect distance bounds: the direct distance cannot exceed the sum of intermediate distances. This prunes invalid world transitions and guarantees shortest-path correctness in Kripke semantics models.
Yes. Kripke semantics define accessibility relations between worlds, allowing you to model possibility spaces across domains. Configure seed/epoch states and accessibility matrices to represent modal logic structures specific to your domain.
Build accessibility matrices from your world configuration, then apply shortest-path algorithms with world_distance calculations under triangle inequality. SLIDE and LEAP moves execute valid hops between accessible worlds.
Understanding modal logic and Kripke semantics concepts is beneficial. The Skill applies these frameworks to compute world transitions and accessibility, so familiarity with reflexive, symmetric, and transitive relations helps you design effective models.
Hops violating triangle inequality are pruned during path computation. The valid_hop algorithm rejects transitions where direct distance exceeds the sum of path distances, ensuring only geometrically sound world transitions execute.
Zhow01Manage structured agent memory with a typed ontology graph via Python CLI.
sanand0Create, analyze, and visualize complex networks and graphs in Python.
parcadeiSolve prime number problems in graph theory using sympy and z3.
rainoftimeEncode program properties into SMT formulas and invoke solvers like Z3 or CVC5.
