Computer Science 188 - Fall 1997 - Russell - Final Exam

# C 2 search keeps all explored nodes in memory d 2

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: (2) - search keeps all explored nodes in memory. (d) (2) Search is a special case of planning. (e) (2) (8x P (x)) _ (8x :P(x)) is a valid sentence. (f) (2) Decision trees with k internal nodes can express any Boolean function of k Boolean attributes. (a) (2) The only unsatis able clause is the empty clause. (b) (2) If C1 and C2 are clauses in propositional logic, and all the literals in C1 are contained in C2, then C1 j= C2 . (c) (3) If C1 and C2 are clauses in propositional logic, and C1 j= C2, then all the literals in C1 are contained in C2. (d) (3) \There is a tortoise who is older than any human" is a good translation of 9t Tortoise(t) ) 8h Human(h) ^ Age(t) > Age(h)] 2. (10 pts.) Logic True/false: 3. (5 pts.) Logic contd. Let C2 be the clause Q(f(a a)) where a is a constant symbol. We are interested in nding a clause C1 such that C1 j= C2 for example, we have C1 = Q(x) or C1 = Q(f(a a))...
View Full Document

## This note was uploaded on 05/17/2009 for the course CS 188 taught by Professor Staff during the Spring '08 term at Berkeley.

Ask a homework question - tutors are online