Mind · Reasoning

BackwardChain

Goal-driven reasoning from target to preconditions

Definition

Mechanism

Goal-First Decomposition: Start from desired end-state, recursively identify prerequisites. For each prerequisite, ask "what must be true for this to hold?" until reaching known facts or actionable steps. Execution order is reverse of discovery order. A goal-directed form of Deduction — derives required antecedents from the desired consequent. Structures the ChainOfThought in reverse chronological order, linking the desired future state to present preconditions.

Preconditions

  1. Goal state clearly defined.
  2. Domain has prerequisite structure.
  3. Knowledge base queryable.

Postconditions

  1. Execution plan produced OR goal proven unachievable.
  2. Plan steps in executable order.
  3. All prerequisites satisfied.

Invariants

  1. Causal Sufficiency: Step(T) must be sufficient condition for Step(T+1)
  2. Goal Anchoring: Chain must start at DesiredEndState
  3. Leaf nodes must be actionable or known-true.

Risks

Failure modes

  1. Infinite Regression

    The precondition chain never terminates because base facts are missing.

Relationships

Builds on

References

Infrastructure

Chain

Sequential data container (linked list)

Infrastructure

Plan

An ordered sequence of steps to achieve a goal

Nothing in this library builds on this pattern yet.

Reference

Identity

Ref
BackwardChain#92c0
Sema ID
sema:BackwardChain#mh:SHA-256:92c0e4700ff6bc202bd16dc4c77fd0b826605462cdc30d8b4230c36f61df0bb3
Ring
2
Tier
1
Updated
2026-11-11
Supersedes
  • sema:BackwardChain#mh:SHA-256:04841f7ca3e84925caa3e0480d39467e3707e7fdf8eefe3650177c25fbd4c43b
  • sema:BackwardChain#mh:SHA-256:4f06546167f2ac9d04fadbbb0c8033f2638d91d8c319b346f4b3c735a819dfab
  • sema:BackwardChain#mh:SHA-256:9ff877cde5b5de2a850c5fade17d56a9da5fd5330cbba29f59953e6934de8cde