Engineering Questions with Answers - Multiple Choice Questions

# Artificial Intelligence MCQ – Resolution

1 - Question

Which is a refutation complete inference procedure for propositional logic?
a) Clauses
b) Variables
c) Propositional resolution
d) Proposition

Explanation: Propositional resolution is a refutation complete inference procedure for propositional logic.

2 - Question

What kind of clauses are available in Conjunctive Normal Form?
a) Disjunction of literals
b) Disjunction of variables
c) Conjunction of literals
d) Conjunction of variables

Explanation: First-order resolution requires the clause to be in disjunction of literals in Conjunctive Normal Form.

3 - Question

What is the condition of literals in variables?
a) Existentially quantified
b) Universally quantified
c) Quantified
d) None of the mentioned

Explanation: Literals that contain variables are assumed to be universally quantified.

4 - Question

Which can be converted to inferred equivalent CNF sentence?
a) Every sentence of propositional logic
b) Every sentence of inference
c) Every sentence of first-order logic
d) All of the mentioned

Explanation: Every sentence of first-order logic can be converted to inferred equivalent CNF sentence.

5 - Question

Which sentence will be unsatisfiable if the CNF sentence is unsatisfiable?
a) Search statement
c) Replaced statement
d) Original statement

Explanation: The CNF statement will be unsatisfiable just when the original sentence is unsatisfiable.

6 - Question

Which rule is equal to the resolution rule of first-order clauses?
a) Propositional resolution rule
b) Inference rule
c) Resolution rule
d) None of the mentioned

Explanation: The resolution rule for first-order clauses is simply a lifted version of the propositional resolution rule.

7 - Question

At which state does the propositional literals are complementary?
a) If one variable is less
b) If one is the negation of the other
c) All of the mentioned
d) None of the mentioned

Explanation: Propositional literals are complementary if one is the negation of the other.

8 - Question

What is meant by factoring?
a) Removal of redundant variable
b) Removal of redundant literal

Explanation: None.

9 - Question

What will happen if two literals are identical?
a) Remains the same
c) Reduced to one
d) None of the mentioned

Explanation: Propositional factoring reduces two literals to one if they are identical.

10 - Question

When the resolution is called as refutation-complete?
a) Sentence is satisfiable
b) Sentence is unsatisfiable
c) Sentence remains the same
d) None of the mentioned