Proof using deduction backward reasoning ( same as backward chaining and goal driven search)

[zak100]

Hi,

I have to proof using backward reasoning. Wikipedia says its same as backward chaining and book says that it is same as goal driven search. I don't then why we call it "backward". Any way my question is:

I have gt(5,2) and I have to prove it. For this purpose I am given a tree and some assumptions:

 

 

Somebody please guide me. Sorry I don't have any idea. Should I try by doing the replacements provided at the end of each level of the tree?

Linked concepts and Questions: By goal driven search it means that we have to start at the current state. How is it different from resolution proof?

 

Zulfi.

 

[zak100]

Hi,

 

This problem has been solved here:

https://math.stackexchange.com/questions/3884163/proof-by-deduction-using-backward-reasoning

Zulfi.