ifc-0150

10.11 Further members of the DIAL-X family

The same contract yields additional algorithms, but only after their targets are stated. The following table is a research specification, not a claim that all of these systems have already passed a complete DIAL ablation.

Method

Operational and structural target

Two repair processes and mixed witness

Admission target

DIAL-RLHF

Scalar reward model when admissible, otherwise a relational or minimax preference representation.

Preference fitting and relation/observer repair; cycles and incompatible local orders form the obstruction.

Held-out preference prediction, exploitability, subgroup consistency, and calibrated refusal of scalarization.

DIAL-RADAR

Feasible recommendation or decision at a relational apex together with its constraint sketch.

Local-chart descent and global relational constraint repair; disagreement on overlaps is mixed evidence.

Exact feasibility, chronological utility, constraint preservation, and robustness.

DIAL-SID

A descended, provenance-bearing global foundry instance.

Local equalizer repair and cross-context data migration; overlap and cocycle defects localize failure.

Descent, source preservation, contradiction reporting, and replay on independent records.

DIAL-CoLT

An auditable reasoning trace and, when required, a revised reasoning sketch.

Inference within a declaration and typed declaration extension; observation–intervention comparison detects incompatible routes.

Grounded warrants, transported evidence, counterexamples, and explicit constructive or speculative status.

These targets also reveal when two names describe different algorithms. For example, DIAL-LASKO with a fixed skill vocabulary is not the same method as DIAL-LASKO permitted to invent new skill types. Their proposal languages and structural targets differ even if they share an optimizer.

They also reveal different creativity claims. DIAL-LASKO can merely tune registered skills or invent a new typed skill; DIAL-RLHF can fit a reward model or replace scalarization with a new relational representation; DIAL-CoLT can search within a reasoning sketch or extend the language of warrants. The second alternative in each pair requires a declared reference space and a transformational mandate rather than retrospective creative language.