Artificial intelligence.

Trace the goal-driven good-dog problem of Example 3.3.4 in a data-driven fashion. Please provide a brief explanation. Thank you

10. Trace the goal-driven good-dog problem of Example 3.3.4 in a data-driven fashion EXAMPLE 3.3.4: GOAL-DRIVEN AND/OR SEARCH This example is taken from the predicate calculus and represents a goal-driven graph search where the goal to be proved true in this situation is a predicate calculus expression containing variables. The axioms are the logical descriptions of a relationship between a 1. Fred is a collie collie(fred) Sam is Fred's master master(fred,sam) The day is Saturday day(saturday) It is cold on Saturday 2. 3. 4. (warm(saturday)) trained(fred) v x[spaniel(X) v (collie(X) trained(X)) gooddog(X)] y(X,Y,Z) [gooddog(X) ^ master(X,Y) ^ location(Y,Z) location(X,Z)] (day(saturday) ^ warm(saturday))- location(sam, park) (day(saturday)(warm(saturday)))location(sam,museum) 5. Fred is trained. 6. Spaniels are good dogs and so are trained collies. 7. If a dog is a good dog and has a master then he will be with his master 8. If it is Saturday and warm, then Sam is at the park. 9. If it is Saturday and not warm, then Sam is at the museum. location (X,Z) Direction of search gooddog(X) master(x,Y) location(Y,Z) collie(X) trained(X) master(fred,sam) day(saturday) (warm(saturday)) collie (fred) trained fred) Substitutions [fred/X, sam/Y, museum/Z Figure 3.25 The solution subgraph showing that fred is at the museum 10. Trace the goal-driven good-dog problem of Example 3.3.4 in a data-driven fashion EXAMPLE 3.3.4: GOAL-DRIVEN AND/OR SEARCH This example is taken from the predicate calculus and represents a goal-driven graph search where the goal to be proved true in this situation is a predicate calculus expression containing variables. The axioms are the logical descriptions of a relationship between a 1. Fred is a collie collie(fred) Sam is Fred's master master(fred,sam) The day is Saturday day(saturday) It is cold on Saturday 2. 3. 4. (warm(saturday)) trained(fred) v x[spaniel(X) v (collie(X) trained(X)) gooddog(X)] y(X,Y,Z) [gooddog(X) ^ master(X,Y) ^ location(Y,Z) location(X,Z)] (day(saturday) ^ warm(saturday))- location(sam, park) (day(saturday)(warm(saturday)))location(sam,museum) 5. Fred is trained. 6. Spaniels are good dogs and so are trained collies. 7. If a dog is a good dog and has a master then he will be with his master 8. If it is Saturday and warm, then Sam is at the park. 9. If it is Saturday and not warm, then Sam is at the museum. location (X,Z) Direction of search gooddog(X) master(x,Y) location(Y,Z) collie(X) trained(X) master(fred,sam) day(saturday) (warm(saturday)) collie (fred) trained fred) Substitutions [fred/X, sam/Y, museum/Z Figure 3.25 The solution subgraph showing that fred is at the museum