NPTEL Fundamentals of Artificial intelligence Week 4 Assignment Answers 2024

1. A physical symbol system has the necessary and sufficient means for general intelligent action. Identify the correct statements with regards to Symbol System Hypothesis

A. Knowledge may be represented as symbol structures.
B. Represents a computational system inspired by the human brain.
C. Intelligent behaviour cannot be achieved through manipulation of symbol structures.
D. Human thinking is a kind of symbol manipulation.

Answer :- For Answers Click Here

2. Identity the correct combination of terms and definitions below.
Terms Definition
P. data X. primitive verifiable facts, of any representation.
Q. information Y. relation among sets of data, that is very often used for further information deduction.
R. knowledge Z. interpreted data

A. P:X; Q:Z; R:Y
B. P:Y; Q:Z; R:X
C. P:X; Q:Y; R:Z
D. P:Y; Q:Z; R:X

Answer :- For Answers Click Here

3. A proposition in a KR language does not mean anything on its own. The___________ (i.e. the meaning) of the proposition must be defined by the language author through ______________.

A. semantics; an interpretation
B. interpretation; a semantics
C. inference, a proof.
D. semantics; theorems

Answer :-

4. Which of the following statements are true for Closed World Assumption?
I. Every constant refers to a unique object.
II. Atomic sentences not in the database are assumed to be false.

A. Neither Statement I nor II
B. Both Statement I and II
C. Statement I only
D. Statement II only

Answer :- For Answers Click Here

5. Consider which of the following statements are correct w.r.t. satisfiability of logical sentences based on the logical operators involved.

I. Universally quantified sentence is satisfied if and only if the enclosed statement is satisfied for all assignments of the quantified variable.

II. Existentially quantified sentence is satisfied if and only if the enclosed statement is satisfied for some but not all assignments of the quantified variable.

A. Both I and II
B. Either I or II
C. I only
D. II only

Answer :-

6. Assertion A: Propositional Logic is a weak Language.
Reason R: In propositional logic, it is hard to identify “individuals”; can’t directly talk about properties of individuals or relations between individuals; and generalizations, patterns, regularities can’t easily be represented.

Mark the correct choice as

A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A.
C. A is True but R is False
D. A is false but R is True

Answer :-

7. Assertion A: A knowledge representation is fundamentally a surrogate.

Reason R: A knowledge representation is a substitute for the thing itself; used to enable an entity to determine consequences by reasoning about the world.

Mark the correct choice as

A. Both A and R are true and R is the correct explanation for A
B. Both A and R are true but R is not the correct explanation for A
C. A is True but R is False
D. A is false but R is True

Answer :- For Answers Click Here

8. Consider which of the following statements are correct w.r.t. nesting of quantifiers:

I. Switching the order of universal quantifiers does not change the meaning

∀x∀yP(x,y) ↔∀y∀xP(x,y).

II. Similarly, one can also switch the order of existential and universal quantifiers

∃x∀yP(x,y) ↔∀y∃xP(x,y).

A. Both I and II
B. Neither I or II
C. I only
D. II only
Consider the predicates listed below:

Professor(x) x is a Professor.

Person(x) x is a person.

Dean(x) x is a Dean.

Friend(x,y) x is a friend of y.

Know(x,y) x knows y.

Criticize(x,y) x criticizes y.

Answer :-

9. Translate the following English statement into First Order Logic statement.

All professors consider the dean a friend or do not know him.

A. ∀x (∃y (Professor(x) ⋀ Dean(y) →Friend(x,y) ⋁ ¬ Know(x,y)))
B. ∀x (∀y (Professor(x) ⋀ Dean(y) →Friend(x,y) ⋁ ¬ Know(x,y)))
C. ∀x (∃y (Professor(x) ⋀ Dean(y) ⋀ Friend(x,y) ⋁ ¬ Know(x,y)))
D. ∀x (∀y (Professor(x) ⋀ Dean(y) ↔ Friend(x,y) ⋁ ¬ Know(x,y)))

Answer :-

10. Translate the following English statement into First Order Logic statement. Person only criticize person that are not their friends.

A. ∀x (∀y (Person(x) ⋀ Person(y) ⋀ Criticize(x,y) → ¬ Friend(y,x)))
B. ∀x (∀y (Person(x) ⋀ Person(y) → Criticize(x,y)⋀¬ Friend(y,x)))
C. ∀x (∀y (Criticize(x,y) → ¬ Friend(y,x)))
D. ∀x (∀y (¬ Friend(x, y) → Criticize(y, x)))