Question

Q7. [20 pt] From the sentences you wrote in Q6, answer the following question using a backward- chaining algorithm. 1) [10] Draw the proof tree generated by a backward chaining algorithm for the query 3 h, Horse(h), where clauses are matched in the order given. 2) [5] What do you notice about this domain? 3) [5] How many solutions for h actually follow from your sentences?

2.An offspring of a horse is a horse.

–Offspring(x,y)∧Horse(y)⇒Horse(x)

Answer 1

=;) Ih, Horse Ch) h, h all a Backward chain domain, where the (ii) It is a Backward chain domain modes are presented as backward. [ii) Total 8 From Question 644 Here H Total 8H 6) ii) An off spring of a Horse is a Horse OH!>H