belief-revision-is-comprehensive-and-minimal

IN derived (depth 3)

The system handles all forms of belief revision through two complementary minimal mechanisms: the outlist primitive provides a single reversible defeat mechanism for challenges, kill-switches, and supersession, while dependency-directed backtracking resolves detected contradictions by retracting the least-entrenched premise with minimal disruption.

Summary

The system covers every kind of belief change using just two simple tools. When something needs to be defeated or overridden, a single reversible mechanism handles it regardless of the pattern. When a contradiction is found, the system fixes it by removing the weakest supporting assumption, changing as little as possible. Together these two pieces handle everything without redundant or specialized machinery.

Justifications

SL — depth-3 — defeat (proactive, via outlist) and contradiction resolution (reactive, via backtracking) are orthogonal subsystems that together cover all belief revision scenarios

Antecedents (all must be IN):

  • non-monotonic-system-is-single-reversible-primitive — The entire non-monotonic reasoning system — challenges, kill-switches, supersession, and dialectics — is built on a single primitive (outlist) that is inherently reversible, with no dedicated machinery for any defeat pattern.
  • contradiction-resolution-is-minimal-disruption — The nogood resolution system minimizes network disruption through layered heuristics: the primary path traces justification chains back to premises and selects the least-entrenched for retraction, the fallback uses dependent count when no traceable chain exists, and all contradictions are unconditionally recorded regardless of resolution outcome.

Dependents

These beliefs depend on this one:

Details