Menoufia University

Subject: Artificial Intelligence

Faculty of Computers & information
3rd year
Department: IT, CS & IS
Time Allowed: Three Hours
2th semester Final Exam
Mark: 70
Date: 12/ 6 / 2013

Year:

Full

Please Answer All Questions;

Question
( 10 Marks)

a) Provide brief, precise definitions of the following:

(1)Agent, (2) Turing Test, (3) Ontology, (4) Semantic Web, (5) Rational
Agent, (6) Autonomy, (7) Episodic Environment and (8) Frames.
b) Differentiate between the following terms.
I. Simple-Reflex agent & Model-Based agent.
II.
Breadth-First & Depth-First according to: Time, Space, and
optimality.
III.
Propositional Logic & First-Order-Logic.
IV.
Declarative (or descriptive) knowledge & procedural
knowledge.
c) Decide if each of the following is True or False.
1. An agent that senses only partial information about the state cannot
be perfectly rational.
2. Every definite clause is a Horn clause.
3. Simple reflex agents cope well with inaccessible environments.
4. Suppose agent A selects its action uniformly at random from the set of
possible actions.
There exists a deterministic, fully observable task environment in
which A is rational.
5. For any propositional sentences ,, if |= ( ^ ) then |= or |
= (or both).
6. For any propositional sentences ,, if |= ( ^ ) then |= and |
= .
7. The input to an agent program is the same as the input to the
corresponding agent function.
8. Input units of a Neural Network can be adjusted during a learning
process.
Question
2
( 10 Marks)

a) I) Develop a PEAS description of the task environment:

Agent Interactive English tutor.
II) Characterize this environment by determining if it is:
Observable / Partially observable, Deterministic /Stochastic,
Episodic/Sequential,
Static/Dynamic, and Discrete/Continuous.
d) Suppose you have a production system with the three rules:
R1: IF A, THEN E
R2: IF B AND F, THEN G
R3: IF C AND E, THEN F
and you have four initial facts: A, B, C, D.
a. Explain what is meant by backward chaining and show explicitly
how it can be used to determine the truth, or otherwise, of fact G.
b. Explain what is meant by forward chaining, and show explicitly
how it can be used in this case to determine new facts.
Question
3
( 20 Marks)
a) Consider the search space below, where S is the start node and G1 and
G2 satisfy the goal test. Arcs are labeled with the cost of traversing
them and the estimated cost to a goal (i.e., the h function) is reported
inside nodes (so lower scores are better). For each of the following
search strategies, indicate which goal state is reached (if any) and list,
in order, all the states popped off of the OPEN list. When all else is
equal, nodes should be removed from OPEN in alphabetical order
(Note: the order of goals is before the order of the other letters in the
search tree).
1.
2.
3.
4.
5.
6.
7.

Breadth First
Depth First
Iterative Deepening
Uniform Cost (i.e., using f = g)
Best-First (using f = h)
Best-First (using f = g + h)
Hill Climbing (using the h function only)

4
8

D
4

B
2

9
9
9

G2

G1

4
J
1

F
2

b) consider using Simulated Annealing as your search strategy. Assume the

current temperature is 10, use value(node) = -h(node).
I. If you are at Node S and simulated annealing has randomly
selected node A for consideration, what is the probability
this node is accepted?
II.
If you are at Node S and simulated annealing has randomly
selected node D for consideration, what is the probability
this node is accepted?

c) Apply the minimax algorithm to the partial game tree below, where it is
the maximizers turn to play and the game does not involve randomness.
The values estimated by the static-board evaluator (SBE) are indicated in the
leaf nodes (higher scores are better for the maximizer). Write the estimated
values of the intermediate nodes inside their circles, and indicate the proper
move of the maximizer by circling one of the rootss outgoing arcs.

Question
( 15 Marks)

a) Compare between
i.
Supervised Learning & Unsupervised Learning.
ii.
Biological Neuron & Artificial Neuron.
iii.
Single-layer Perceptrons & Multi-layer Perceptrons
a) (9) The following table shows sample date obtained from two different
Fruits.
Fruit 1 (Class C1)
Fruit 2 (Class C2)
I.

II.

Weight(grams)
115
120
209
185

Length (cm)
15.5
16.4
9.2
7.9

Train a single layer preceptron model using the above parameters to

classify the two fruits.(suppose that W1= -30, W2=300, b(0)=W0=1230, x0=+1 =0.01 )
Using the model parameters you have obtained classify the fruit
with weight 135gm and length 16.5cm.

Question
( 15 Marks)

a). According to political pundits, a person who is radical (R) is electable (E)
if he/she is conservative (C), but otherwise is not electable. Which of the
following are correct representations of this assertion?
i. (R E) C
ii. R (E C)
iii. R ((C E) E)
b). Put these propositional-logic sentences into clausal form.
i. (P ^ Q) (A B)
ii. (P Q) (A ^ B)
c) For each pair of atomic sentences, give the most general unifier if it exists:

i. P(A,B,B), P(x,y,z ).
ii. Older(Father(y),y),

Older(Father(x),John).

e) Represent the following sentences in first-order logic, using a consistent

vocabulary:
i.
ii.
iii.
iv.

Everything painted by Picasso is valuable.

Students who took CS101 but did not take CS102 must take
Math103.
No person buys an expensive policy.
There is an agent who sells policies only to people who are not
insured.

f) Show that the sentences

and

x [ y P(x,y)]=> Q(x)
x y [P(x,y)=> Q(x)]

are logically equivalent by converting into CNF, show each step in the
process.
__________________________________________________________________________

With my Best Wishes

Dr\ Heba Elbeh