Free Printable QUIZ 1 - Knowledge Representation

1.

_________is a record like structure which consists of a collection of attributes and its values to describe an entity in the world.

a)

Semantic Network

b)

Frame

c)

Logical Representation

d)

Production Rules

2.

∀ X cat(X) → hasTail (Y) can be used to represent “All cats have tail”

a)

True

b)

False

3.

Given a predicate logic ;

∀ X infected_by(X, virus) → sick (X)

‘sick’ is a

a)

Variable

b)

Connective

c)

Predicate

d)

Constant

4.

Which of these is a correct predicate logic of the following sentence

“Baby drinks milk”

a)

(∀ X) (baby(X) → drinkMilk(X))

b)

(∀ X) (∀ Y) (baby(X) ^ milk(Y)→ drink(X, Y))

c)

∃x baby(X) milk (Y) →drink (X,Y)

d)

∃x baby(X) milk (Y) ¬drink (X,Y)

5.

Which of these English sentences is a correct translation for the predicate logic :

∀ x mother (x) ^ loves (x, children) →lovely (x )

a)

Some mothers who love children are lovely mother

b)

There are no mother who loves children is a bad mother

c)

There exist a mother who loves children but cruel

d)

All of the above

6.

Given a natural language statement as follow: "Everyone taking AI loves Green Technology"

The predicate logic is :

∀ x taking (x,AI) ^ loves_Green_Technology(x)

a)

True

b)

False

7.

Which of these is a correct predicate logic of the following sentence;

“The girl who lives at room 79 is a Japanese”

i. address(girl, 79) ^ citizenship(girl, Japan)

ii. (∀ X) (∀ Y) (girl(X) ^ address(79)→ citizenship (X, Japan))

iii. (∃X)(girl(X)^address(X, 79)^citizenship(X, Japan))

iv. (∀X)(girl(X)^address(X, 79)^citizenship(X, Japan))

a)

i,iii

b)

ii,iii,iv

c)

i,ii

d)

all of the above

8.

Which of the following statements is FALSE about predicate logic?

a)

The use of quantifiers allow predicate logic to handle infinite domain.

b)

Constant and variable associated with object, while predicate describe relations between objects

c)

→ is the main connective with ∀

d)

→ is the main connective with Ε

9.

Based on the below premises,

∀x(Healthy(x) ∧ Rich(x)) → Happy(x)

Healthy(Anna)

Rich(Anna)

We can infer that Anna is happy by applying:

i. Modus Tolen

ii. And-Introduction

iii. Modus Ponen

iv. Universal Elimination

a)

i,ii

b)

ii,iii,iv

c)

i,iii,iv

d)

ii,iii

10.

What is the goal of refutation resolution in automated reasoning?

a)

To find all models that satisfy the Knowledge Base

b)

To derive a tautology

c)

To derive an empty clause showing the Knowledge Base entails the conclusion

d)

To find a new consistent Knowledge Base

QUIZ 1 - Knowledge Representation

Total questions: 10

Worksheet time: 5mins

Similar Resources on Wayground