Opening Rule-Based Systems: Backward and Forward Chaining (MIT 6.034 Artificial Intelligence)
Rule-Based Systems: Backward and Forward Chaining (MIT 6.034 Artificial Intelligence)
- Length
- 47 min
- Level
- Undergraduate
- Recorded
- MIT2014
Chapter 1 of 7: Before the lecture
Rule-based reasoning systems execute backward and forward chaining algorithms to derive conclusions from a knowledge base of assertions and rules. The session walks through a Harry Potter-themed problem from a past quiz to demonstrate how backward chaining builds a depth-first goal tree while forward chaining systematically fires applicable rules. The analysis covers variable binding, consequent matching, and the tie-breaking rules that govern rule execution order. Additionally, it examines edge cases such as impotent rules and duplicate assertions that often trip up students on examinations.

Your comment is kept while you sign up.Sign in
Seifter builds a full backward-chaining goal tree to test whether Millicent becomes Hermione's friend.
Rule-based reasoning systems execute backward and forward chaining algorithms to derive conclusions from a knowledge base of assertions and rules. The session walks through a Harry Potter-themed problem from a past quiz to demonstrate how backward chaining builds a depth-first goal tree while forward chaining systematically fires applicable rules. The analysis covers variable binding, consequent matching, and the tie-breaking rules that govern rule execution order. Additionally, it examines edge cases such as impotent rules and duplicate assertions that often trip up students on examinations.
2009 Quiz 1
This lecture
Lecture 24 of 27 of Artificial Intelligence.
Choose a node to see how it connects to this lecture. What comes before is on the leftat the top. What comes after is on the rightat the bottom. The ring is what it teaches. People and places are above. Other lectures and books are below.
Press a chosen node again to open it.