1. A Term is either an individual constant (a 0-ary function), or a variable, or an n-ary function applied to n terms: F(t1 t2 ..tn).

a) True

b) False

View Answer

Explanation: Definition of term in FOL.

2. Which are needed to compute the logical inference algorithm?

a) Logical equivalence

b) Validity

c) Satisfiability

d) All of the mentioned

View Answer

Explanation: Logical inference algorithm can be solved be using logical equivalence, Validity and satisfiability.

3. From which rule does the modus ponens are derived?

a) Inference rule

b) Module rule

c) Both a & b

d) None of the mentioned

View Answer

Explanation: Inference rule contains the standard pattern that leads to desired goal. The best form of inference rule is modus ponens.

4. Which is also called single inference rule?

a) Reference

b) Resolution

c) Reform

d) None of the mentioned

View Answer

Explanation: Because resolution yields a complete inference rule when coupled with any search algorithm.

5. Which form is called as conjunction of disjunction of literals?

a) Conjunctive normal form

b) Disjunctive normal form

c) Normal form

d) All of the mentioned

View Answer

Explanation: None.

6. First Order Logic is also known as,

a) First Order Predicate Calculus

b) Quantification Theory

c) Lower Order Calculus

d) All of the mentioned above

View Answer

Explanation: None.

7. The adjective “first-order” distinguishes first-order logic from ___________ in which there are predicates having predicates or functions as arguments, or in which one or both of predicate quantifiers or function quantifiers are permitted.

a) Representational Verification

b) Representational Adequacy

c) Higher Order Logic

d) Inferential Efficiency

View Answer

Explanation: None.

8. Which is not Familiar Connectives in First Order Logic?

a) and

b) iff

c) or

d) not

View Answer

Explanation: “not” is coming under propositional logic and is therefore not a connective.

9. Inference algorithm is complete only if,

a) It can derive any sentence

b) It can derive any sentence that is an entailed version

c) It is truth preserving

d) Both b & c

View Answer

Explanation: None.

10. An inference algorithm that derives only entailed sentences is called sound or truth-preserving.

a) True

b) False

View Answer

Explanation: None.

**Sanfoundry Global Education & Learning Series – Artificial Intelligence.**

__here is complete set of 1000+ Multiple Choice Questions and Answers on Artificial Intelligence__.