This preview shows page 1. Sign up to view the full content.
Unformatted text preview: EN ('(?x) studies a lot')) P4: IF (AND(('(?x) studies a lot'),
'(?x) is a protagonist')
THEN ('(?x) becomes Hermione's friend')) P5: IF (AND('(?x) snogs (?y)'.
'(?x) lives in Gryffindor Tower'
'(?y) lives in Slytherin dungeon')
THEN ('(?x) has a bad term')) Assertions: A0: (Millicent lives in Slytherin dungeon) A1: (Millicent is ambitious)) A2: (Seamus lives in Gryffindor Tower) A3: (Seamus snogs Millicent) 13 This is a tear off sheet, with copies of drawings. You need not hand this page in.
Graph for Part 2A Graph for Parts 2B and 2C. Part C uses the heuristic distance estimates above and
below the nodes. Part B does not. 14...
View Full Document
This document was uploaded on 03/17/2014 for the course EECS 6.034 at MIT.
- Fall '10
- Artificial Intelligence