Hour Exam
#3
Name_______________________________________
Friday, Dec. 6
100 pts.
I.
Expertise
a. (10 pts.) Describe the architecture of an expert system, labeling the
individual parts.
b. (10 pts.) Write
a rule in CLIPS which says that if
(bread-fails-to-rise) and (room-is-cold) then assert (turn-furnace-on) and
print a message saying that it may take a few more minutes.
c. (10 pts.) We
want to construct an expert system for computer problem diagnosis. To do this, we need a template for computers
that has entries for the computer-type, age, and operating-system. Write a deftemplate for this in CLIPS.
c. (5 pts.) What
knowledge representation scheme is represented by a deftemplate?
II. Computation
Consider
the FSA given by the following state-transition table: (A is the start state, D
the final state).
|
in
state |
Symbol |
go
to state |
|
A |
a |
B |
|
A |
b |
C |
|
B |
c |
C |
|
B |
d |
D |
|
C |
c |
B |
a. (10 pts.) Draw
a picture of this FSA (states and labeled arrows between states)
b. (10 pts.) Give
an example of a string (using the characters a,b,c, and d) accepted by the FSA,
and two strings (using the same set of characters) not accepted by the FSA for
two different sorts of reasons, saying why they are not accepted.
c. (5 pts.) What
end condition is required for a PDA to accept a string of characters?
d. (10 pts.) What
features make up a Turing Machine?
e. (5 pts.) How
is the Turing Machine programmed? That
is, what sort of entries do we find in the state-transition table for a Turing
Machine?
f. (10 pts.) Given
the grammar for expressions:
E
-> E + T | E – T | T
T
-> T * F | T / F | F
F
-> a | b | c | ( E )
Give
a parse tree for the expression
a
* (b + c)
III. (15 pts.) Give
a description of Searle’s “Chinese Room”.
What takes place there? In what
way does this attack symbolic AI?