Unformatted text preview: CS 188 introduction to Al
an 1999 Stuart Real] Midterm You have 1 hour and 21“.] minutes. The exam is openbook, opennotes.
Hill points total. You will not necessariiy ﬁnish all questions. so do your best ones ﬁrst.
1‘ul‘vfrite your answers in blue books. Check you haven’t skipped any by accident. Hand them all in. Panic not. 1. {18 pts.) ’I‘ruefli‘nlse
Decide if each of the following is true or false. if you are not sure you may wish to provide a brief explanation
to follow your answer.
[a] {3] a. rational agent outperforms all nonrational agents because it knows the actual outcome ofits actions.
{b} {3] A sound logical reasoning procedure is not necessary for passing the Turing test.
[c] {3) Internal state is of no use to an agent that lives in an accessible environment.
[d] [3] R{F{y}.y,s] and Ris.F{A},F(tI]) are uniﬁable.
[e] {3] Simple hillclimbing is a complete algorithm for solving CSPs.
{f j {3] its .1: :9: is a satisﬁable sentence.
2. [20 pts.} Search, constraint satisfaction
it. domino is made by sticking together two squares along an edge. An roomino is made by sticking together It squares along edges, any way you please. Thus, there is only one possible domino shape, but there are two
distinct 3~ominoes {3—in—arrow and L—shapod]. {a} (ti) Suppose we have to construct an mention that is beautiful, for fixed 11. Give a complete formulation
of the searsi problem that corresponds to this task, renaming that a beauty detector is available.
[b] {5] Identify a suitable search algorithm for this task and explain your choice. {c} {5) Give an upper bound, in terms of n, on the number of possible nominoes. [Hint think about the
branching factor for the mnstruction process} [dl {5] N ow consider the problem of tiling a given womino with dominoes—that is, covering it exactly without
overlapping any dominoes. Formulate this problem precisely as a constraint satisfaction problem. 3. {14 pts.) Propositional Logic
Assume we have the following propositions: Betteryﬂeod, Radio Works, Ontﬂfcss, and CorStan‘s. [You may
use the abbreviations E, El. G, C in your answer.)
(a) {2} What is the total number of possible models? Us} [4} How many models are there in which the following sentence is false?
[Radio Warts h CorSterts} => [IﬂutﬂfGosﬁ. antteryDeod} [c]: [4} Is the above sentence equivalent to a set of Horn clauses? Explain.
{d} [4} Prove that the above sentence is not entailed by the sentence Radio Works :5 nﬁntieryﬂend.
4. {12 pts.) Firstorder logic
Let M{s:] be true if :r is a mail carrier; ﬁfe] be true if .t' lives in Berkeley; and His, y) be true if it knows y.
Translate the following sentences into first+order logic:
{a} {ti} There are at least two mail carriers who live in Berkeley. [b] [6] All the mail carriers who live in Berkeley know each other. ...
View
Full Document
 Spring '08
 Staff
 Computer Science

Click to edit the document details