In this exercise, use the sentences you wrote in Exercise folhorsesexercise to answer a question by using a backwardchaining algorithm.

Draw the proof tree generated by an exhaustive backwardchaining algorithm for the query ${\exists\,h\;\;}{Horse}(h)$, where clauses are matched in the order given.

What do you notice about this domain?

How many solutions for $h$ actually follow from your sentences?

Can you think of a way to find all of them? (Hint: See @Smith+al:1986.)
Answer
Improve This Solution
View Answer