Interface: VariableFeasibilityDto
@kortexya/reasoninglayer / VariableFeasibilityDto
Interface: VariableFeasibilityDto
Section titled “Interface: VariableFeasibilityDto”Defined in: src/types/spaces.ts:182
Reachability of a single binary choice-point variable.
Remarks
Section titled “Remarks”Produced by mode = "feasibility" search.
canBeTrue = truemeans the solver actually observed a valid assignment with this variable = 1 (a witnessed model).canBeFalse = truemeans the solver observed a valid assignment with this variable = 0.canBeTrue = false && canBeFalse = falsemeans the problem is UNSAT.
When the underlying solver hits a conflict/time budget before the opposite
polarity could be proven (im)feasible, verified is false and the
reachability fields reflect only the polarities that were actually
witnessed. For example, (canBeTrue: true, canBeFalse: false, verified: false) means “observed in every model found so far, never
observed as 0 — likely required, but the solver did not complete the
UNSAT-for-0 probe to certify it.”
Properties
Section titled “Properties”canBeFalse
Section titled “canBeFalse”canBeFalse:
boolean
Defined in: src/types/spaces.ts:186
True if the solver witnessed a valid assignment where this variable is 0.
canBeTrue
Section titled “canBeTrue”canBeTrue:
boolean
Defined in: src/types/spaces.ts:184
True if the solver witnessed a valid assignment where this variable is 1.
verified
Section titled “verified”verified:
boolean
Defined in: src/types/spaces.ts:192
True when the reachability result is fully determined by the solver (both polarities resolved). False when a conflict/time limit was hit and the result reflects only the polarities that were observed.