This preview shows page 1. Sign up to view the full content.
Unformatted text preview: both A1 and
A2, the match with A1 is considered first. Run forward chaining on the rules and assertions provided on page 2. For the first two
iterations, fill out the first two rows in the table below, noting the rules whose antecedents match
the data, the rule that fires, and the new assertions that are added by the rule. For the remainder,
supply only the fired rules and new assertions. You have more than enough room. Matched Fired New Assertions Added to List of Assertions 1
10 6 Problem 2: Search (50 Points) You have just moved to a strange new city, and you are trying to learn your way around. Most
importantly, you want to learn how to get from your home at S to the subway at T. In all search problems,use alphabetical order to break ties when deciding the priority to use for
extending nodes. Part A (15 points)
Using depth-first search with backtracking and with an extended list, draw that part of the search
tree that is explored by the search. 7 What is the final path found from the start (S) to the goal (T)?...
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence