Download CUSTOMER_CODE SMUDE DIVISION_CODE SMUDE

CUSTOMER_CODE
SMUDE
DIVISION_CODE
SMUDE
EVENT_CODE
May2017
ASSESSMENT_CODE BT9402_May2017
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
13594
QUESTION_TEXT
Define Scripts. Explain the advantages & Disadvantages of Script. Why
Scripts are beneficial?
Scripts
A set of circumstance which are prescribed by a structure which are
expected to follow on from one another are said to be a Script. It is a
thought sequence or continuation of situations which are expected. With
more specialized roles it is considered to have more number of slots or
frames.
Roger Schank, Robert P. Abelson and their research group in their early
AI work developed the Scripts. This is a method of presenting
procedural language. The may look like frames, with a difference to fill
the slots is in a ordered fashion.
Advantages
The advantages of Script are:
SCHEME OF
EVALUATION



Events and answering the question are predictable by scripts.
Unusual events can be detected.
From a collection of observations a single coherent interpretation
can be built up.
Disadvantages
The disadvantages of Script are:




Less general than frames.
All kinds of knowledge cannot be represented.
Ad hoc
Scripts either only account for details in a restricted domain so
they are not interesting or they apply everywhere which is not
likely.
Why are Scripts beneficial?
Scripts are beneficial because:

In known runs or patterns, Events tend to run.



Existence of causal relationships between events.
To allow an event to take place there exist an entry conditions.
Prerequisites exist upon events taking place. E.g. when a student
progresses through a degree scheme or when a purchaser buys a
house.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
13595
QUESTION_TEXT
Explain various actions used in conceptual dependency theory.
SCHEME OF
EVALUATION
i.ATRANS: It refers to a transfer of possession the abstract transfer of
possession from one person to another, as in a give or a buy. No physical
transfer need take place, the transfer occurs purely on the plane of
ownership.
ii.PTRANS: it refer to a transfer of physical relation- some objects
moved from place to place, as in a go or a move ownership need not
transfer, possession- the abstract transfer of possession from one person
to another. No physical transfer need take place, the transfer occurs
purely on the plane of ownership.
iii.MTRANS: It refers to the transmission of an idea- some
conceptualization is transmitted from one head to another. Tell, forget
and remember can all be expressed with MTRANS.
iv.MOVE: It refers to the movement of the body part, not the movement
of an object. Normally, MOVE is instrumental to some other action but
sometimes it is used by itself.
v.PROPEL: It refers to the application of force to an object. Normally
PROPEL is instrumental to some other action, but sometimes it is used
by itself. (2 marks each)
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
72846
QUESTION_TEXT
Write any five Features of Expert System
SCHEME OF
EVALUATION
(2*5=10 marks)
Goal driven reasoning or backward chaining–an inference technique which uses if
THEN rules to repetitively break a goal into smaller sub goals which are easier to
prove.
Coping with uncertainty: the ability of the system to reason with rules and data which
are not precisely known.
Data driven reasoning or forward chaining – an inference technique which uses IF
THEN rules to deduce a problem solution from initial data.
Data representation– the way in which the problem specific data in the system is
stored and accessed
User interface –that portion of the code which creates an easy to use system
Explanations –the ability of the system to explain the reasoning process that it used
to reach a recommendation.
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
126149
QUESTION_TEXT
Write the algorithm for Blind search Depth first search. Discuss its
advantages and disadvantages.
Algorithm 4 marks
i.Set L t e a list of the initial nodes in the problem
ii.If L is empty, fail otherwise pick the first node n from L
iii.If n is a goal state, Quit and return path from initial node
iv.Else remove n from L and add to the front of L all of n’s children.
Label each child with its path from the initial node. Return to 3.
SCHEME OF
EVALUATION
Advantages 3 marks
i.Always finds the goal
ii.Requires less memory space compared to BFS
iii.DFS is preferred over BFS when the search tree is known to have a
plentiful number of goals.
Disadvantages
3 marks
i.Often can be slow
ii.Can result in an exhaustive search
iii.Can get stuck in long paths that don’t reach the goal
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
126151
QUESTION_TEXT
SCHEME OF
EVALUATION
What is hill climbing strategy? Discuss its drawbacks and solutions.
1.pick a random point in the search space
2.consider all the neighbors of the current state
3.choose the neighbor with the best quality and move to that state
4.repeat 2 through 4 until all the neighboring states are of lower quality
5.return the current state as the solution state
Drawbacks:
local maxima: a peak that is lower than the highest peak in the state
space. Once on a local maximum, hill climbing will halt, even
though there is a better solution
plateau: area of the state space where the evaluation function is nearly
fla. Hill climbing will do a random walk in such an area
ridges: a ridge can have steeply sloping sides, so that the search reaches
the top with ease, but on the top may slope gently toward a peak.
Unless there happens to be operators that move directly along the
top of the ridge the search may oscillate from side to side making
little or no progress.
Solutions:
backtracking
making big jumps
applying multiple rules before testing
QUESTION_TYPE
DESCRIPTIVE_QUESTION
QUESTION_ID
126154
QUESTION_TEXT
Write resolution algorithm. What are the different strategies used to
select clauses to be resolved?
Algorithm – 3 marks
Resolution strategy – 7 marks
Level saturation – 3 marks
Set of support – 2 marks
SCHEME OF
EVALUATION
Unit preference – 1mark
Linear resolution – 1 mark