Sr.

No Question A

The knowledge engineer might already be an

expert in the domain, or might need to work with
1 knowledge acquisition
real experts to extract what they know—a process
called ____________

The statement comprising the limitations of FOL

2 Expressiveness
is/are ____________

first order logic also known as

3 Lower Order Calculus
___________________
a ________________ is some one who investigate
a particular domain, learns what concepts are
4 important in that domain, and creates a formal Mechanical engineering
representation of the objects and relations in the
domain.

The adjective “first-order” distinguishes first-order

logic from ___________ in which there are
Representational
5 predicates having predicates or functions as
Verification
arguments, or in which one or both of predicate
quantifiers or function quantifiers are permitted.

6 A Term with no variables is called a ground term

Which statement is an correct example of

7 x King(x) ⇒ Person(x) .
universal quantification

Which statement is an correct example of x Crown(x) ∧ OnHead(x,

8
Existential quantification John) .

Knowledge Engineering is field of Artificial

9 TRUE
Intelligence

Which is not a property of representation of Representational

10
knowledge? Verification

Why First Order Predicate Logic more its uses Relations And
11
expressive than Propositional Logic ? Variables only.

Constant term,
12 First Order Logic symbol can be a? Variable Term or a
Function
 Predecessor and
13 Rules in First Order Logic has two parts?
Succesor

What is correct About The Universal

14 symbolized by " ∃ ".
Quantifier.

It is a Weak
What is correct about the First Order Logic Knowledge
15
(FOL). Representation
Language

works towards a Final

16 What is Fordward Chaining ?
Stage.

works from a initial

17 What is Backward Chaining ?
Stage.

It is a Valid Inference
18 what is Resolution?
Rule.
 B C D Correct Answer

PEAS Process Knowledge task knowledge gathering option A

Formalizing Natural
Many-sorted Logic All Of Above option D
Languages

Multivariable Calculus single-variable calculus None option A

comunication Knowledge Engineering None option C

Representational
Higher Order Logic new order logic option C
Adequacy

no term zero term unit term option A

∀ x King(x) ⇒ Person(x) . x King(x) ∧ Person(x) x King(x) v Person(x) option B

∃ x Crown(x) ∧
x King(x) ∧ Person(x) x King(x) v Person(x) option D
OnHead(x, John) .

FALSE TRUE

Inferential Adequacy Inferential Efficiency Acquisitional Efficiency. option A

Uses
uses None of the
uses only Quantifiers Relations,Variable option c
above
and Quantifiers

Constant term and a

only Contant term Only A function Option A
Variable term
 Quantifier And Predecessor and Relations and a
Option A
Succesor Variable function
it is not applicable to
Pronounced as "there Pronounced as " for
all variables in the Option D
exists" all ".
predicate.

it is a Foundation it is Declarative in it is a Higher Level

Option D
Level Logic Nature. Logic

there should be a also called as " Goal-

Path from Start to Driven Inference Top-Down Reasoning. Option B
Goal Technique".

also called as " Goal-

it is used in "Design
Driven Inference Bottom-Up Reasoning Option B
Expert System"
Technique".

it is not the only

inference rule
was Discovered in It is a Recursive
needed to build a Option A
1980 Algorithm
Sound and Complete
theorm proof maker