next up previous
Next: About this document

Practice Questions for Midterm

Intro to AI Show (Su 97)
Selmer Bringsjord

Note: It is possible that some of the following questions will appear on the actual midterm; it is even possible that many of the following questions will appear on the actual exam. Therefore, it would be prudent to try in earnest to answer the following questions.

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

tex2html_wrap_inline239 a
discrete actions
tex2html_wrap_inline239 b
actions with different durations
tex2html_wrap_inline239 c
single agents
tex2html_wrap_inline239 d
the wumpus world
tex2html_wrap_inline239 e
none of the above

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

displaymath255

tex2html_wrap_inline239 a
True
tex2html_wrap_inline239 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_inline239 a
lists
tex2html_wrap_inline239 b
elements
tex2html_wrap_inline239 c
mapping functions
tex2html_wrap_inline239 d
generic functions
tex2html_wrap_inline239 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_inline239 a
undecidable
tex2html_wrap_inline239 b
referentially transparent
tex2html_wrap_inline239 c
referentially opaque
tex2html_wrap_inline239 d
compact
tex2html_wrap_inline239 e
none of the above

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

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

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

displaymath293

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

displaymath297

tex2html_wrap_inline239 a
reductio ad absurdum
tex2html_wrap_inline239 b
paramodulation
tex2html_wrap_inline239 c
existential introduction
tex2html_wrap_inline239 d
universal elimination
tex2html_wrap_inline239 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_inline239 a
T
tex2html_wrap_inline239 b
NIL
tex2html_wrap_inline239 c
an error message
tex2html_wrap_inline239 d
a stack overflow warning
tex2html_wrap_inline239 e
none of the above

Question 8. Suppose that KB tex2html_wrap_inline319 includes the information in the blocks world grid for Selmer's World 3 (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.

displaymath321

Then KB tex2html_wrap_inline323 .

tex2html_wrap_inline239 a
true
tex2html_wrap_inline239 b
false

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

tex2html_wrap_inline239 a
tex2html_wrap_inline333
tex2html_wrap_inline239 b
tex2html_wrap_inline337
tex2html_wrap_inline239 c
tex2html_wrap_inline341
tex2html_wrap_inline239 d
tex2html_wrap_inline345
tex2html_wrap_inline239 e
none of the above

Question 10. Given that the function

(defun fn (x y) (if (= y 0) 9999999999 (/ x y)))

has been defined, typing (fn 6 3) will return what?

tex2html_wrap_inline239 a
9999999999
tex2html_wrap_inline239 b
an error message
tex2html_wrap_inline239 c
2
tex2html_wrap_inline239 d
18
tex2html_wrap_inline239 e
none of the above

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

displaymath359

tex2html_wrap_inline239 a
Yes
tex2html_wrap_inline239 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_inline239 a
Yes, No, Yes
tex2html_wrap_inline239 b
Yes, Yes, Yes
tex2html_wrap_inline239 c
No, No, No
tex2html_wrap_inline239 d
No, Yes, Yes
tex2html_wrap_inline239 e
none of the above

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

K1
tex2html_wrap_inline377
K2
tex2html_wrap_inline379
K3
tex2html_wrap_inline381
K4
tex2html_wrap_inline383
K5
tex2html_wrap_inline385
K6
tex2html_wrap_inline387
K7
tex2html_wrap_inline389
K8
tex2html_wrap_inline391
K9
tex2html_wrap_inline393
K10
tex2html_wrap_inline395

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

tabular144

Which rule of inference is used here?

tex2html_wrap_inline239 a
And-Elimination
tex2html_wrap_inline239 b
Or-Elimination
tex2html_wrap_inline239 c
Modus Ponens
tex2html_wrap_inline239 d
Unit Resolution
tex2html_wrap_inline239 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_inline239 a
Strong
tex2html_wrap_inline239 b
Weak

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

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

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

tex2html_wrap_inline239 a
If KB tex2html_wrap_inline441 then KB tex2html_wrap_inline443
tex2html_wrap_inline239 b
If KB tex2html_wrap_inline443 then KB tex2html_wrap_inline441
tex2html_wrap_inline239 c
If KB tex2html_wrap_inline441 and KB tex2html_wrap_inline455 then KB tex2html_wrap_inline441
tex2html_wrap_inline239 d
If KB tex2html_wrap_inline443 and KB tex2html_wrap_inline463 then KB tex2html_wrap_inline443
tex2html_wrap_inline239 e
none of the above

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

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

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

displaymath479

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

tex2html_wrap_inline239 a
Someone loves everyone.
tex2html_wrap_inline239 b
Everyone loves someone.
tex2html_wrap_inline239 c
No one loves everyone.
tex2html_wrap_inline239 d
There is someone everyone loves.
tex2html_wrap_inline239 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_inline239 a
tex2html_wrap_inline495
tex2html_wrap_inline239 b
True tex2html_wrap_inline499
tex2html_wrap_inline239 c
tex2html_wrap_inline503
tex2html_wrap_inline239 d
False tex2html_wrap_inline499
tex2html_wrap_inline239 e
all of the above can be put in Horn form

Questions 20-22. (The following three 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_inline513 } -- given to SEEK, we assume, at random -- might result in the prediction 16, based on the view that tex2html_wrap_inline515 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_inline519 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_inline239 a
No, No, Yes, Yes, Yes
tex2html_wrap_inline239 b
Yes, No, No, Yes, No
tex2html_wrap_inline239 c
Yes, No, No, Yes, Yes
tex2html_wrap_inline239 d
Yes, No, Yes, Yes, Yes
tex2html_wrap_inline239 e
none of the above

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

tex2html_wrap_inline239 a
predicting
tex2html_wrap_inline239 b
searching the space
tex2html_wrap_inline239 c
sequencing
tex2html_wrap_inline239 d
finding the underlying function
tex2html_wrap_inline239 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.




next up previous
Next: About this document

Selmer Bringsjord
Tue Jun 3 19:49:22 EDT 1997