next up previous
Next: About this document

Midterm

Intro to AI Show (Su 97)
Selmer Bringsjord

Question 1. Russell and Norvig move from the situation calculus to the event calculus because the former has trouble representing

tex2html_wrap_inline250 a
discrete actions
tex2html_wrap_inline250 b
single agents
tex2html_wrap_inline250 c
multiple agents
tex2html_wrap_inline250 d
the wumpus world
tex2html_wrap_inline250 e
none of the above

Question 2. Suppose that tex2html_wrap_inline260 and a = b are in KB tex2html_wrap_inline264 . In standard first-order logic

displaymath266

tex2html_wrap_inline250 a
True
tex2html_wrap_inline250 b
False

Question 3. Consider the following Lisp function.

(defun predp (o)

(or (symbolp o)

(characterp o)

(numberp o)

(packagep o)))

This is a predicate function that tests for Lisp objects that Shapiro calls

tex2html_wrap_inline250 a
lists
tex2html_wrap_inline250 b
elements
tex2html_wrap_inline250 c
mapping functions
tex2html_wrap_inline250 d
generic functions
tex2html_wrap_inline250 e
none of the above

Question 4. Without special treatment, mental objects create a problem for AI as described in the R&N text because standard first-order logic is

tex2html_wrap_inline250 a
undecidable
tex2html_wrap_inline250 b
referentially transparent
tex2html_wrap_inline250 c
referentially opaque
tex2html_wrap_inline250 d
compact
tex2html_wrap_inline250 e
none of the above

Question 5. Selmer's objection to N&R's approach to mental objects is that

tex2html_wrap_inline250 a
strings are contradictory
tex2html_wrap_inline250 b
beliefs aren't generally about strings
tex2html_wrap_inline250 c
their approach goes beyond standard first-order logic
tex2html_wrap_inline250 d
they don't use modal logic
tex2html_wrap_inline250 e
none of the above

Explain the objection in no more than 3 sentences. (Write neatly on this sheet.)

Question 6. Let tex2html_wrap_inline302 be the substitution {x/Tina, y/Charlie}. And suppose that

displaymath304

is in KB tex2html_wrap_inline306 . What rule of inference can be used to establish

displaymath308

tex2html_wrap_inline250 a
reductio ad absurdum
tex2html_wrap_inline250 b
paramodulation
tex2html_wrap_inline250 c
existential introduction
tex2html_wrap_inline250 d
universal elimination
tex2html_wrap_inline250 e
none of the above

Question 7. Suppose that you type

> (setf iai-students '(mary bill jane henry ralph))

to Lisp. Given that the function

(defun obnoxious-ais-inp (roster)

(cond ((null roster) nil)

((eql 'ralph (first roster)) t)

(t (obnoxious-ais-inp (rest roster)))))

has been defined, typing

> (obnoxious-ais-inp iai-students)

will return

tex2html_wrap_inline250 a
T
tex2html_wrap_inline250 b
NIL
tex2html_wrap_inline250 c
an error message
tex2html_wrap_inline250 d
a stack overflow warning
tex2html_wrap_inline250 e
none of the above

Question 8. Suppose that KB tex2html_wrap_inline330 includes the information in the blocks world grid for Selmer's World (shown on our web site). (So the knowledge base in question contains all formulas that can be observed from this grid.) Suppose that the following formula is added to this knowledge base.

displaymath332

Then KB tex2html_wrap_inline334 .

tex2html_wrap_inline250 a
true
tex2html_wrap_inline250 b
false

Question 9. Which of the following first-order formulas could represent ``Alma's mother loves all maternal grandparents," where ``L(x,y)' stands for ``x loves y."

tex2html_wrap_inline250 a
tex2html_wrap_inline344
tex2html_wrap_inline250 b
tex2html_wrap_inline348
tex2html_wrap_inline250 c
tex2html_wrap_inline352
tex2html_wrap_inline250 d
tex2html_wrap_inline356
tex2html_wrap_inline250 e
none of the above

Question 10. Given that the function

(defun fn (r d e) (cons (list d r (first e)) (rest e)))

has been defined, typing (fn '* 34 '(5 - 6 * 8 * 8)) will return what?

tex2html_wrap_inline250 a
-214
tex2html_wrap_inline250 b
an error message
tex2html_wrap_inline250 c
(8 * 8 * 6 - (34 * 5))
tex2html_wrap_inline250 d
((34 * 5) - 6 * 8 * 8)
tex2html_wrap_inline250 e
none of the above

Question 11. Consider the following sentence in the propositional calculus. Is it valid?

displaymath370

tex2html_wrap_inline250 a
Yes
tex2html_wrap_inline250 b
No

Question 12. Given the following information, could an agent with the reasoning power of the propositional calculus prove that the unicorn is mythical? How about magical? Horned?

If the unicorn is mythical, then it is immortal, but if it is not mythical, then it is a mortal mammal. If the unicorn is either immortal or a mammal, then it is horned. The unicorn is magical if it is horned.

tex2html_wrap_inline250 a
Yes, No, Yes
tex2html_wrap_inline250 b
Yes, Yes, Yes
tex2html_wrap_inline250 c
No, No, No
tex2html_wrap_inline250 d
No, Yes, Yes
tex2html_wrap_inline250 e
none of the above

Question 13. Suppose that KB tex2html_wrap_inline386 for an agent trying to thrive in the wumpus world contains the following 10 facts:

K1
tex2html_wrap_inline388
K2
tex2html_wrap_inline390
K3
tex2html_wrap_inline392
K4
tex2html_wrap_inline394
K5
tex2html_wrap_inline396
K6
tex2html_wrap_inline398
K7
tex2html_wrap_inline400
K8
tex2html_wrap_inline402
K9
tex2html_wrap_inline404
K10
tex2html_wrap_inline406

Consider the following part of a proof, carried out by an agent with KB tex2html_wrap_inline386 .

tabular146

Which rule of inference is used here?

tex2html_wrap_inline250 a
And-Elimination
tex2html_wrap_inline250 b
Or-Elimination
tex2html_wrap_inline250 c
Modus Ponens
tex2html_wrap_inline250 d
Unit Resolution
tex2html_wrap_inline250 e
none of the above

Question 14. A propoent of AI would probably not be all that impressed with Deep Blue's performance.

tex2html_wrap_inline250 a
Strong
tex2html_wrap_inline250 b
Weak

Question 15. What are the operators in R&N's approach to the 8-puzzle?

tex2html_wrap_inline250 a
the blank moves in 4 directions
tex2html_wrap_inline250 b
a tile moves in 4 directions
tex2html_wrap_inline250 c
a row moves up or down
tex2html_wrap_inline250 d
a column moves right or left
tex2html_wrap_inline250 e
none of the above

Question 16. That first-order logic is complete amounts to which of the following statements?

tex2html_wrap_inline250 a
If KB tex2html_wrap_inline464 then KB tex2html_wrap_inline466
tex2html_wrap_inline250 b
If KB tex2html_wrap_inline466 then KB tex2html_wrap_inline464
tex2html_wrap_inline250 c
If KB tex2html_wrap_inline464 and KB tex2html_wrap_inline478 then KB tex2html_wrap_inline464
tex2html_wrap_inline250 d
If KB tex2html_wrap_inline466 and KB tex2html_wrap_inline486 then KB tex2html_wrap_inline466
tex2html_wrap_inline250 e
none of the above

Question 17. What is the most general unifier for the following pair of sentences.

tex2html_wrap_inline250 a
{y/John, x/John}
tex2html_wrap_inline250 b
{y/x}
tex2html_wrap_inline250 c
{y/John, x/y}
tex2html_wrap_inline250 d
{y/x, x/y}
tex2html_wrap_inline250 e
none of the above

Question 18. Here is a formula in first-orderlogic:

displaymath502

This formula corresponds to what English sentence, given that `` tex2html_wrap_inline504 " means ``x loves y"?

tex2html_wrap_inline250 a
Someone loves everyone.
tex2html_wrap_inline250 b
Everyone loves someone.
tex2html_wrap_inline250 c
No one loves everyone.
tex2html_wrap_inline250 d
There is someone everyone loves.
tex2html_wrap_inline250 e
none of the above

Question 19. A proof procedure based on generalized modus ponens is not complete (among other reasons) because there is no Horn form representation of formluas like

tex2html_wrap_inline250 a
tex2html_wrap_inline518
tex2html_wrap_inline250 b
True tex2html_wrap_inline522
tex2html_wrap_inline250 c
tex2html_wrap_inline526
tex2html_wrap_inline250 d
False tex2html_wrap_inline522
tex2html_wrap_inline250 e
all of the above can be put in Horn form

Questions 20-23. (The following four questions are related to problem 3.16 in the book.) The artificial agent SEEK operates as follows. It perceives a sequence of postive integers, generated by some sequence function f(n), and then predicts the next number in the sequence. For example, the sequence {1, 2, 4, 8, tex2html_wrap_inline536 } -- given to SEEK, we assume, at random -- might result in the prediction 16, based on the view that tex2html_wrap_inline538 in this case. Let's suppose that the space of possible functions consists of all expressions built from the elements 1 and n, and the functions tex2html_wrap_inline542 and exponentiation. Suppose that the program for SEEK has been written in Common Lisp, so that

> (seek '(1 2 4 8))
16
(exp (+ 1 1) n)

20. Recall the breakdown of environments in terms of whether they are

Mark the correct Yes/No sequence for these categories and SEEK, respectively.

tex2html_wrap_inline250 a
No, No, Yes, Yes, Yes
tex2html_wrap_inline250 b
Yes, No, No, Yes, No
tex2html_wrap_inline250 c
Yes, No, No, Yes, Yes
tex2html_wrap_inline250 d
Yes, No, Yes, Yes, Yes
tex2html_wrap_inline250 e
none of the above

21. In PAGE description of SEEK, the G would be

tex2html_wrap_inline250 a
predicting
tex2html_wrap_inline250 b
searching the space
tex2html_wrap_inline250 c
sequencing
tex2html_wrap_inline250 d
finding the underlying function
tex2html_wrap_inline250 e
none of the above

22. Suppose that an agent IQ, incorporating both SEEK and the program ANALOGY discussed in the R&N text, has the ability to score 200 on any and all IQ-tests given it. Take a stand as to whether IQ's arrival would mean that AI had truly succeeded. Defend your position in two paragraphs, relating what you say to the reading.

23. How long would it take Ralph to produce the Common Lisp code that brings SEEK to life?

tex2html_wrap_inline250 a
less time than any human
tex2html_wrap_inline250 b
a fraction of a nanosecond
tex2html_wrap_inline250 c
a fraction of the time it would take Selmer
tex2html_wrap_inline250 d
a fraction of the time it would take ``Junior"
tex2html_wrap_inline250 e
all of the above




next up previous
Next: About this document

Selmer Bringsjord
Wed Jun 18 22:00:58 EDT 1997