Question

In this question we will use the sentences you wrote in Exercise 9.9 to answer a question using a backward-chaining algorithm.
a. Draw the proof tree generated by an exhaustive backward-chaining algorithm for the query Эh Horse (h), where clauses arc matched in the order given.
b. What do you notice about this domain?
c. How many solutions for h actually follow from your sentences?
d. Can you think of a way to find all of them?


$1.99
Sales0
Views199
Comments0
  • CreatedFebruary 14, 2011
  • Files Included
Post your question
5000