1 P E C S
USN
PESIT Bangalore South Campus
Hosur road, 1km before Electronic City, Bengaluru -100
Department of Computer Science and Engineering
INTERNAL ASSESSMENT TEST II-solution copy
Date : 01/10/18 Max Marks: 40
Subject & Code: ARTIFICIAL INTELLIGENCE/15CS562 Section: A,B,C
Name of Faculty: Prof. ARTI ARYA, SUDEEPA ROY DEY Time: 8:30-10:00 am
Note: Answer FIVE full questions. Selecting one question from each part.
Part I
Q1 Trace any one the following crypt arithmetic problem such that :-
CROSS OR BASE
+ ROADS + BALL
======== ======
DANGER GAMES
1)Thus finally the solution is,D = 1 A = 5 N = 8 G = 7 E = 4 R = 6 C = 9 O = 2 S = 3
2)B=7 A=4 S=8 E=3 L=5 G=1 M=9
(ALL STEPS MUST BE SHOWN TO GET FULL MARKS)
OR
Q2 Differentiate between Inheritable Knowledge and Inferential knowledge with appropriate examples.
INHERITABLE KNOWLEGDE
One of the most useful forms of interface is Property Interface, in which elements of specific classes inherit
attributes and values from more general classes in which they are included. For supporting property
Inheritance, the objects must be organized into classes and must be arranged in generalization hierarchy.
Following figure shows some additional Baseball knowledge instead into a Frame
INFERENTIAL
The knowledge, which can use inference mechanism to use this knowledge is called inferential
B.E(CSE)Vth
knowledge.
The inheritance property is a very powerful form of inferential knowledge.
The inference procedures implement the standard logic rules of inference.
There are two types of inference procedures like forward inference and backward inference.
Forward inference moves from start state to goal state whereas backward In this type of knowledge
several symbols are generally used like ∀ (universal quantifier), ∃(existential quantifier), → (arrow
indicator) etc.
For example: All cats have tails
∀ X: cat (x) → has tail (x)
Advantages:
1) A set of strict rules are defined which can be used to derive more facts.
2) Truths of new statements can be verified.
3) It gives guarantee about the correctness.
4) Many inference procedures available to implement standard rules of logic.
inference moves from goal state to start state.
Part II
Q3 Explain what a Frame Problem with a suitable example.
• The whole problem of representing the facts, which change as well as that do not change is
called as the frame problem. In some domain the only difficult part is representing all the
facts.
• Ex: In robot world, there may be a table with plant on it under the window.
• Suppose we now move the table to centre of the room. Therefore, there is a chance and it has
to be inferred that the plant is now in the centre of the room but the window is not.
• To support this kind of reasoning, some systems make use of some an explicit set of axioms
called as frame axioms which describe all the things that do not change when a particular
operator is applied in state ‘n’ to produce state ‘n+1’.
Therefore, for robot domain the axiom may be written as
• color (x, y, x1) ^ move (x, s1, s2) → color (x, y, s2)
• where color (x, y, s1) can be read as if x has colour in state s1and the operation of moving x is
B.E(CSE)Vth
applied in the state to produce state s2, then the colour of x in S2 is still y.
• Now the question arise how is undo the effect changes in the problem state description:
• Eg:- Suppose we wish to undo the effect of moving the table to the center of the Room.
• · There are two ways in which this problem can be solved.
• a) Do not modify the initial state description at all. At each node store an indication of the
specific changes that should be node at this node. Whenever it is necessary to refer to the
description of the current problem state, look at the initial state description also look back
through all the nodes on the path from start state to current state.
OR
Q4 Explain in details the issues in knowledge representations.
Important attributes
Relationship amongst attributes
Granularity
Set of Objects
Finding the right structure
Part III
Q5 Why Propositional or Simple logic fails to represent knowledge? State an example to show its
incompetency. And how Predicate logic handles that situation? Give an example?
Propositional logic is easy to represent world knowledge which could be required by an AI
system
Propositional logic is simple to deal with and is declarative.
Propositional logic permits conjunctive/disjunctive/partial/negative information.
Real world facts can be written as well-formed formulas (wffs) e.g.Socrates is a man
SOCRATESMAN
It is cold COLD
Propositional logic has very limited expressive power e.g. Search a
candle in all locality shops has a clear meaning to search all shops in the locality for candle. But
propositional logic will require separate statement for each shop
Propositions could be deceptive or extremely difficult to draw a meaningful conclusion e.g.
IRFANMAN and INZMAMMAN produce totally different assertion
B.E(CSE)Vth
Propositional logic assumes world is all full of facts so constitute wffs accordingly.Reasoning with
propositional logic is difficult
OR
Q6 1)Explain the Algorithm to unify(L1, L2)
2)Trace the operation unification algorithm for the following literals :-
1. f(marcus) and f(caesar)
2. f(x) and f(g(y))
3. f(marcus, g(x,y)) and f(x, g(caesar,marcus))
4. knows( john,x) ,knows (y, mother(y))
PART IV
Q7. 1. Consider the following facts:
a. Steve likes all kinds of food.
b. Apples are food.
c. Chicken is food.
d. Anything anyone eats and isn’t killed by is food.
e. Bill eats peanuts and still alive.
f. Sue eats everything Bill eats.
Do the following:-
i. Translate these sentences into formulas in predicate logic.
ii. Convert these formulas to Clause form (Conjunctive normal form).
B.E(CSE)Vth
iii. Prove that Steve likes peanut using resolution
iv. Also answer” What does Sue eat?”
B.E(CSE)Vth
Q8 What is Resolution?Does Resolution only answer “ True(Yes)” or “False(No)” for questions? Give an
example in favour of your answer.
Assume the following facts:
1.Steve only likes easy courses.
2.Science courses are hard.
3. All the courses in the basketweaving department are easy.
4. BK301 is a basketweaving course.
Use resolution to answer “What course would Steve like?”
Part V
Q9 What is Reasoning? Give a suitable example to support why Non monotonic reasoning is preferred over
predicate logic?
When we require any knowledge system to do something it has not been explicitly told how to do it
must --àreason.
The system must figure out what it needs to know from what it already knows.
Reasoning is the act of deriving a conclusion from certain premises using a given methodology. In
particular it must be able to deal with:
Incompleteness – compensate for lack of knowledge.
Inconsistencies – resolve ambiguities and contradictions.
Change – it must be able to update its world knowledge base over time.
Clearly in order to deal with this some decision that a made are more likely to be true (or false)
than others and we must introduce methods that can cope with this uncertainty (Process of
thinking/ Drawing inference)
B.E(CSE)Vth
OR
Q10. Write short notes on any two
i) Prolog vs Logic ii)Closed world Assumption iii) JTMS
Differences between Logic & PROLOG
• Quantification is provided implicitly.
Variables all in UPPER –CASE and all
1.In logic, variables are constants in lower case or numbers.
explicitly quantified. • For AND, its comma(,) and nothing
Explicit symbols for AND and for OR. ( Disjunction is represented
OR as list of alternative stmts)
pq • q :- p ( q is head of the rule)
• (interpreter works backwards from
goal).
• PROLOG interpreter has fixed
control strategy. So assertions
define a particular search path to
an answer to any question.
111
Simple kind of minimalist reasoning.
says that the only objects that satisfy any
predicate P are those that must.
Eg. A company’s employee database, Airline
database
CWA is powerful as a basis for reasoning
with Databases, which are assumed to be
complete with respect to the properties they
describe.
24
B.E(CSE)Vth
How JTMS works?
Each supported belief (assertion) in has a justification.
Each justification has two parts:
An IN-List -- which supports beliefs held.
An OUT-List -- which supports beliefs not held.
An assertion is connected to its justification by an arrow.
One assertion can feed another justification thus creating the
network.
Assertions may be labelled with a belief status.
An assertion is valid if every assertion in the IN-List is
believed and none in the OUT-List are believed.
An assertion is non-monotonic is the OUT-List is not empty or
if any assertion in the INList is non-monotonic
B.E(CSE)Vth
