Step by step procedure of backward chaining-00390
This subjective question is related to the book/course
vu cs201 Introduction to Programming.
It can also be found in
vu cs201 Mid Term Solved Past Paper No. 8.
Question 1: Step by step procedure of backward chaining
Answer:
- Start with the goal.
- Goal may be in WM initially, so check and you are done if found!
- If not, then search for goal in the THEN part of the rules (match conclusions, rather than premises). This type of rule is called goal rule.
- Check to see if the goal rule?s premises are listed in the working memory.
- Premises not listed become sub-goals to prove.
- Process continues in a recursive fashion until a premise is found that is not supported by a rule, i.e. a premise is called a primitive, if it cannot be concluded by any rule
- When a primitive is found, ask user for information about it. Back track and use this information to prove sub-goals and subsequently the goal. (Page 126)
