Teleological Intent Gate
Kind: algorithm
Record: algorithms:teleological-intent-gate
Canonical: Algorithms
Closure: Dependencies in load order
Resolve what the checklist is for before planning it: enumerate the admissible decomposition branches, score each by utility minus cost against the normalized intent and change relation, and gate on the highest-worth admissible branch before any seeing or deriving.
Listed in Algorithm contracts, after Dynamic Discovery Pattern Generation and before Planning Stage.