Interface: ProofTraceNodeDto
@kortexya/reasoninglayer / ProofTraceNodeDto
Interface: ProofTraceNodeDto
Section titled “Interface: ProofTraceNodeDto”Defined in: src/types/conversation.ts:306
A proof trace node for backward chaining derivation trees.
Properties
Section titled “Properties”children?
Section titled “children?”
optionalchildren?:ProofTraceNodeDto[]
Defined in: src/types/conversation.ts:328
Child nodes in the proof tree.
confidence?
Section titled “confidence?”
optionalconfidence?:number
Defined in: src/types/conversation.ts:318
Optional confidence score.
detail?
Section titled “detail?”
optionaldetail?:string
Defined in: src/types/conversation.ts:314
Optional detail text.
id:
string
Defined in: src/types/conversation.ts:308
Unique node ID.
label:
string
Defined in: src/types/conversation.ts:310
Display label for the node.
nodeType
Section titled “nodeType”nodeType:
string
Defined in: src/types/conversation.ts:312
Node type (e.g., “goal”, “rule”, “fact”).
optionalrule?:string
Defined in: src/types/conversation.ts:316
Optional rule name/ID used at this step.
substitutions?
Section titled “substitutions?”
optionalsubstitutions?:Record<string,string>
Defined in: src/types/conversation.ts:326
Variable bindings applied at this step, keyed by variable name.
Remarks
Section titled “Remarks”The keys are the variable names as the proof writes them (?X, Person),
passed verbatim — they are data, not schema, and are never re-cased.