Kubnal Bridge

Techniques & Methods

Backward Chaining

Backward chaining starts with a hypothesis or goal and works backward, identifying what conditions or facts must be true to prove the goal. It repeatedly queries subgoals until either base facts are reached (confirming the goal) or the chain fails (refuting it).

Used in Prolog, expert systems, and automated theorem provers, backward chaining is efficient when the goal space is small and well-defined. In contrast, forward chaining is better suited to data-rich environments where many possible conclusions could be derived.

Authority Links

Related Terms