backward reasoning
**Backward reasoning** (also called **backward chaining** or **goal-directed reasoning**) is the problem-solving strategy of **starting from the desired goal or conclusion and working backward** to determine what conditions, steps, or premises are needed to reach it — essentially asking "what would need to be true for this conclusion to hold?"
**How Backward Reasoning Works**
1. **Start with the Goal**: Identify what you want to prove or achieve.
2. **Identify Prerequisites**: Ask "What conditions must be met for this goal to be true?"
3. **Recurse**: For each prerequisite, ask the same question — "What is needed for THIS to be true?"
4. **Ground**: Continue until you reach known facts, given information, or base cases.
5. **Verify**: Check that all prerequisites are satisfied by available information.
**Backward Reasoning Example**
```
Goal: Prove that the number 144 is a perfect
square.
Backward: What would make 144 a perfect square?
→ There exists an integer n where n² = 144.
What integer n satisfies n² = 144?
→ n = √144
→ n = 12
→ 12 is an integer ✓
Therefore, 144 = 12² is a perfect square. ✓
```
**Backward vs. Forward Reasoning**
- **Forward Reasoning**: Start from known facts → apply rules → derive new facts → hope to reach the goal. Can explore many irrelevant paths.
- **Backward Reasoning**: Start from the goal → identify what's needed → check if it's available. More focused — only explores paths relevant to the goal.
- **Best Choice**: Backward reasoning is more efficient when the goal is specific and the knowledge base is large (many possible forward paths but few lead to the goal).
**When to Use Backward Reasoning**
- **Mathematical Proofs**: Start with what you want to prove → work backward to identify sufficient conditions → verify those conditions.
- **Diagnostic Problems**: "The system failed. What could have caused this?" → trace backward from failure to possible causes.
- **Planning**: "I need to be at the airport by 3 PM. What time should I leave?" → work backward from the deadline.
- **Logic Puzzles**: Start with the unknowns → determine what constraints apply → work backward to find the solution.
- **Debugging**: Start from the bug symptom → trace backward through the code to find the root cause.
**Backward Reasoning in LLM Prompting**
- Instruct the model to reason backward:
- "Start from the conclusion and work backward to verify it."
- "Assume the answer is X. What would need to be true? Check each condition."
- "What conditions are necessary and sufficient for this goal?"
- **Verification by Backward Reasoning**: After forward solving, verify the answer by starting from it and checking that it satisfies all problem constraints — this catches errors in the forward reasoning.
**Benefits**
- **Efficiency**: Avoids exploring irrelevant forward-reasoning paths — stays focused on the goal.
- **Verification**: Natural verification mechanism — the backward path either reaches known facts (verified) or reaches a dead end (disproven).
- **Insight**: Often reveals the key conditions or bottlenecks in a problem — shows exactly what's needed for the conclusion.
Backward reasoning is a **fundamental problem-solving strategy** — it turns the question from "where does this lead?" into "what do I need?" — often finding more direct paths to solutions.