Practice Questions for Final

Intro to AI Show (Su 97)
Selmer Bringsjord

Note:

1. It is possible that some of the following questions will appear on the actual final; 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.
2. Always pick the best answer of those available.

Question 1. The expression

denotes

a

an action

b

a term in FOL

c

a situation

d

a and b

e

b and c

Question 2. Suppose that and are in KB . In standard first-order logic

a

True

b

False

Question 3. Consider the following Lisp function.

(defun s-t (n vector)

(check-type n number)

(check-type vector list)

(mapcar #'(lambda (x) (* x n)) vector))

Which of the following could be a possible input/output pair from this function?

a

(s-t 5 5), 25

b

(s-t 5 (1 2 3 4 5)), (5 10 15 20 25)

c

(s-t 5 '(1 2 3 4 5)), (5 10 15 20 25)

d

(s-t 5 '(1 2 3 4 5)), 15)

e

none of the above

Question 4. Consider the following quote.

Everyone knows that dragons don't exist. But while this simplistic formulation may satisfy the layman, it does not suffice for the scientific mind. The brilliant Cerebron, attacking the problem analytically, discovered three distinct kinds of dragon: the mythical, the chimerical, and the purely hypothetical. They were all, one might say, nonexistent, but each nonexisted in an entirely different way.

-Stanislaw Lem

Which operator in FOL can be used to make distinctions between things that don't exist, like dragons, and things that do?

a

b

c

d

b and c

e

none of the above

Question 5. Which of the following are reasons for introducing a quasi-logical form?

a

To make it easier to write simple compositional grammar rules.

b

To extend the expressiveness of the semantic representation language.

c

To be able to represent quantifier scoping ambiguities in a succinct form.

d

a and c

e

a b c

Question 6. This question concerns a language we call Buffalo , which is very much like English except the only word in its lexicon is buffalo. Here are two sentences from the language:

• Buffalo buffalo buffalo Buffalo buffalo.
• Bufalo Buffalo buffalo buffalo buffalo Buffalo buffalo.

Here are two English sentence with corresponding syntactic structure:

• Dallas cattle bewilder Denver cattle.
• Chefs London critics admire cook French food.

Write a grammar for Buffalo . The lexical categories are adjective, noun, and (transitive) verb. There should be one grammar rule for sentence, one for verb phrase, and three rules for noun phrase: raw noun, adjective modifier, and reduced relative clause (i.e., a relative clause without the word `that'). Your grammar should be written neatly in the space provided just below.

Question 7. Consider the following Common Lisp function.

(defun f ()

(let (results)

(dolist (person (get 'people 'list) results)

(let ((age (get person 'age))

(dolist (friend (get person 'friends))

(when (> (get friend 'age) age) (pushnew person results)))))))

In three succinct sentences, characterize this function. (Use the space provided just below.)

Question 8. (Tricky) Suppose that KB includes the information in the blocks world grid for ``Catching Colonel West" (shown on our web site). (So the knowledge base in question contains all information presented by the visual information in the 8 8 grid, as well as formulas that can be observed from this grid.) Suppose that the following formula is added to this knowledge base.

Then

• KB

a

true

b

false

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

a

b

c

d

e

none of the above

Question 10. Of the two functions mapcar and mapc, which would be used if the objective of the Common Lisp programmer was to only cause certain side-effects?

a

mapcar

b

mapc

c

either one; it doesn't matter

d

actually macroexpand is the way to go

e

none of the above

Question 11. Consider the following sentence in first-order logic. Is it valid?

a

Yes

b

No

Question 12. Consider the following sentence in first-order logic. Is it valid?

a

Yes

b

No

Question 13. Recall the ``Guessing Game." We shall say that a guessing rule is ``winning" just in case the following is true. If you use the rule to choose your guesses, then no matter which set I have in mind, you are guaranteed to win in the limit. Specify a winning guessing rule for our game. (Write in the space provided just below.)

Question 14. Which of the following is the weight update rule used in back-propagation?

a

b

c

d

a and b

e

a, b and c

Question 15. Construct by hand a neural network that computes the XOR function of two inputs. Make sure to specify what sort of units you are using. (Write your diagram in the space provided just below.)

Question 16. How many solutions are there to the 6-queens puzzle? Write the number here:

Question 17. Suppose that we abbreviate ``Turing Machine (TM) m cannot ascertain whether or not TM m' halts after starting with input i" by . Given this, and given that the list is an enumeration of all TMs, which of the following sums up the halting problem?

a

b

c

d

e

none of the above

Question 18. Which of the formulas in the set of possible answers for the previous question are true?

a

a only

b

a and b

c

a, b and c

d

a, b, c and d

e

none of the above

Question 19. Fill in the missing values for the clause in the following set of clauses, given that C is the resolvent of and . (Write your answer in the space provided.)

• 
• 
• 

Question 20. Is the following inference -- line 3 from lines 1 and 2 -- valid?

a

Yes

b

No

Question 21. Behavior-based robotics is an approach that would seem to have trouble giving robots the capability to

a

avoid obstacles

b

do proprioception

c

fetch the cup from room it was in yesterday

d

avoid expensive explicit deliberation

e

none of the above

Question 22. Which of the following are reasons for building robots?

a

augmenting human physical abilities

b

giving humans telepresence

c

dealing with hazardous environments

d

automating ``gofer" tasks

e

all of the above

Question 23. Consider the following CL code.

(defun generates-sequencep (exp sequence)

(let ((fn (make-fn exp)))

(dotimes (n (length sequence) t)

(unless (eql (funcall fn n) (elt sequence n))

(return nil)))))

Of the agents you have heard discussed in this class, which is most likely to be based in part on this code? Answer:

Question 24. Why is the lambda-operator useful for parsing? One sentence (make reference to the parse of ``John loves Mary" by Shapiro's ELIZA):

Question 25. Match the following sets of equations (on left) with the learning techniques on the right by drawing a line from one to the other.

Question 26. The following table specifies a certain Boolean function (with 3 inputs).

The name of this function is:

A formula from the propositional calculus (using three propositional variables and the connectives and ) that represents this function is:

Question 27. Here are the three laws of robotics from the science fiction book I, Robot by Asimov:

1. A robot may not injure a human being or through inaction allow a human being to come to harm.
2. A robot must obey the orders given to it by human beings except where such orders would conflict with the first law.
3. A robot must protect its own existence as long as such protection does not conflict with the first or second law.

Are these laws sensible in your opinion? Can you think of a better set of laws? Answer these questions in a succinct essay.

Question 28. Was Ralph stumped by the Liar Paradox? How about Junior?

a

No; Yes

b

Yes; No

c

Yes; Yes

d

No; No

e

none of the above

• About this document ...