§04 Reasoning — Governed Autonomous Reasoning — The loop, as a governed composition
Mars® Spec › §04 Reasoning — Governed Autonomous Reasoning › The loop, as a governed composition
← What this section covers, and when it applies · Section index · Composition requirements →
2. The loop, as a governed composition
Governed autonomous reasoning is the closed loop:
traverse → detect gap → acquire → synthesize → register → repeat
Each stage is an existing governed operation. The loop is conformant iff every stage is governed and the trail across stages is unbroken and recomputable.
| Stage | The existing governed operation it is | Constituent requirements |
|---|---|---|
| Traverse | Map-governed traversal of the bidirectional, order-typed substrate — following the domain map, not raw proximity | §03-ii S3 (N-way navigation), S8 (symbolic↔embedding round-trip), S10 (traversal-governed vs. graph-proximity); §03-iii §2.3 (multi-guide traversal, §03-iii S2/S3) |
| Detect gap | Identification of a typed gap from the gap machine or a calibration divergence | §03-iii §2.0 (canonical gap state machine), §2.5 (bounded exploration / gap-on-insufficiency, §03-iii S5); §01 §5.1 (variant consistency map — the metric-vs-meaning calibration signal); §03-ii S14 (conflict entry gap propagation) |
| Acquire | A resolution action routed through the gap machine + the symmetric reinforcement mechanism | §03-iii §2.0 (Open → In-resolution → Resolved) + §2.10 (reinforcement loop discipline) + §2.11 (data gap resolution lifecycle); §01 §10 (completeness and gap referral) |
| Synthesize | A higher-order synthesis act over a selection of order/perspective/variant/prior-higher-order outputs | §01 §11 (higher-order synthesis); D10 (synthesized output type-checked and auditable), D11 (unconstrained-but-declared input selection) |
| Register | Enrollment of the newly acquired or synthesized structure as first-class, versioned, walkable model/KB structure | §01 §11 composition-provenance record; D42 (higher-order registration as a scope-extending amendment); §02b §5 (delta-attestation lifecycle) |
| Recompute | The trail across the whole loop is independently re-derivable | §03-iii §2.7 (recomputation witness) and §03-iii S1 (recomputable grounded verdict); §02b §2 Field 7 (order-typed recomputation witness) |
The rest of this section states the composition requirements — the requirements that are not already stated by any single constituent operation, because they govern how the stages join into a loop.
← What this section covers, and when it applies · Section index · Composition requirements →