Fundamentals of Artificial Intelligence Week 4 Answers
Are you looking for Fundamentals of Artificial Intelligence Week 4 Answers? All weeks solutions of this Swayam course are available here.
Table of Contents
Fundamentals of Artificial Intelligence Week 4 Answers (July-Dec 2025)
Course link: Click here to visit course on Nptel Website
Question 1. 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
Question 2. 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 can be achieved through manipulation of symbol structures.
d) Human thinking is a kind of symbol manipulation.
These are Fundamentals of Artificial Intelligence Week 4 Answers
Question 3. Consider which of the following statements are correct w.r.t. entailment in first-order logic being semi-decidable.
I. Algorithms exist that say yes to every entailed sentence
II. No algorithm exists that says no to every non-entailed sentence.
a) Both I and II
b) Either I or II
c) I only
d) II only
Question 4. Entailment for FOL is __________: algorithms exist that say yes to every entailed sentence, but no algorithm exists that also says no to every non-entailed sentence.
a) Decidable
b) Semidecidable
c) Efficient
d) Undecidable
Question 5. Consider the statement ¬(P Ù Q) ≡ (¬P Ú ¬Q). Identify which of the following are correct.
a) Formulas ¬(P Ù Q) and (¬P Ú ¬Q) have the same truth tables.
b) The symbol ≡ is a connective.
c) The statement is a propositional formula which evaluates to a truth value.
d) The statement means ‘the two formulas are equivalent.’
Question 6. The negation of a universal statement (“x 𝜑) is logically equivalent to the following existential statement
a) ∃x ¬𝜑
b) ¬∃x 𝜑
c) ∀x ¬𝜑
d) ¬∀x 𝜑
These are Fundamentals of Artificial Intelligence Week 4 Answers
Question 7. Assertion A Propositional Logic is a weak Language.
Reason R Every statement in propositional logic consists of propositional variables combined via propositional connectives.
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
Question 8. 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
Question 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)))
Question 10. Translate the following English statement into First Order Logic statement.
Person only criticize persons 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)))
These are Fundamentals of Artificial Intelligence Week 4 Answers