add-justification-achieves-consistent-propagation
IN derived (depth 2)
Adding a justification to an existing node produces a fully consistent network state through guaranteed-terminating multi-dimensional propagation: truth values cascade via BFS through dependents, the reverse index is updated, and access tags recompute transitively — all within a single operation whose termination is guaranteed by BFS traversal and stop-on-unchanged semantics.
Summary
When you add a new justification to an existing node, the system guarantees that everything stays fully consistent afterward. Truth values, dependency tracking, and access tags all update in one shot through a process that is guaranteed to finish without getting stuck in loops or blowing up the stack.
Justifications
SL — Multi-dimensional propagation composed with termination guarantees yields a consistent single-operation update
Antecedents (all must be IN):
- add-justification-is-fully-propagating — Adding a justification triggers complete multi-dimensional propagation: truth values cascade through dependents via BFS, the dependents reverse index is updated on both antecedent and outlist nodes, and access tags flow downstream transitively through all dependent chains.
- propagation-terminates-deterministically — Truth propagation is guaranteed to terminate: BFS prevents stack overflow, stop-on-unchanged prevents oscillation, and fixpoint iteration bounds the outer loop
Dependents
These beliefs depend on this one:
- justification-addition-is-robust-across-graph-states — Adding a justification to an existing node achieves fully consistent multi-dimensional propagation — truth values, dependents index, and access tags — even when the dependency graph contains dangling references or lifecycle-marked nodes, because propagation safely handles both graph anomalies and node lifecycle states.