Module capability_gap 

Gap analysis & capability logic (§24, legal_logic.md) — anti-deficit / RPL.

Computes what is present versus what is lacking by set difference over capabilities — the engine for Recognition of Prior Learning (RPL) and the “Peace-Infrastructure” deployment strategy (deploy to the computed gap, not by assumption). Experiential/traditional knowledge counts as held when an authoritative skos:closeMatch links it to the required formal capability. Zero-heap (caller-supplied out).

Constants

MAX_CAP_NODES

Bound on capability nodes in one pathfinding query.

Functions

capability_gap

The computable gap: the required capabilities that are NOT held (directly or by recognised equivalence), written to out. Returns the count. Gap = Req \ Holds.

estimate_capability

Bayesian estimate of P(holds capability | related achievements): a posterior from a prior and the fraction of related achievements that are present. Returns the prior unchanged if there is no related evidence. P = prior·L / (prior·L + (1−prior)·(1−L)), L = present/total.

learning_path_cost

Shortest-cost educational path to acquire goal from the held capabilities, over a prerequisite graph edges = (from, to, cost) (“from from you can learn to at cost”). Returns the minimum total cost, or None if goal is unreachable. Bounded Dijkstra (A* with an admissible zero heuristic over a non-negative-cost graph); zero-heap (fixed arrays). nodes enumerates the capability ids (the index space, ≤ MAX_CAP_NODES).

meets_competency_level

RPL competency level: a held competency at held_level satisfies a required_level requirement iff it is at least as high (e.g. AQF/EQF level mapping).

requirements_met

Are all requirements met (the gap is empty)?