Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 17
Q541:
Which proof strategy prefers clauses with one literal?
A. Unit resolution
B. Clause chaining
C. Set of support
D. Horn clause
Correct Answer:
A
Chapter: 17
Q542:
Set of support strategy in resolution refutation:
A. Selects all clauses
B. Focuses on goal-related clauses
C. Eliminates unit clauses
D. Ignores negated conclusion
Correct Answer:
B
Chapter: 17
Q543:
What is the goal of using resolution refutation?
A. To satisfy all premises
B. To prove a contradiction
C. To derive a tautology
D. To simplify expressions
Correct Answer:
B
Chapter: 17
Q544:
A variable or the negation of a variable is called a:
A. Clause
B. Unit
C. Formula
D. Literal
Correct Answer:
D
Chapter: 17
Q545:
C is provable from A ∨ B, ¬A ∨ C, ¬B ∨ C. What should be negated to start refutation?
A. A
B. B
C. C
D. D
Correct Answer:
C
Chapter: 17
Q546:
CNF expressions are evaluated based on:
A. Disjunctions only
B. Conjunctions of disjunctions
C. Exclusive OR operations
D. Simple conjunctions
Correct Answer:
B
Chapter: 17
Q547:
The clause (¬A ∨ C) is an example of:
A. A literal
B. An implication
C. A clause in CNF
D. An invalid CNF statement
Correct Answer:
C
Chapter: 17
Q548:
In CNF, to satisfy the entire statement:
A. Only one clause must be true
B. All literals must be true
C. Each clause must be satisfied
D. Only the negation must be valid
Correct Answer:
C
Chapter: 17
Q549:
Each clause in CNF can be viewed as:
A. A negation
B. A requirement
C. A variable
D. An operator
Correct Answer:
B
Chapter: 17
Q550:
If no contradiction can be derived in resolution, what does it imply?
A. The proof is successful
B. The proof is complete
C. The conclusion cannot be proved
D. All statements are tautologies
Correct Answer:
C
Chapter: 17
Q551:
The clause A ∨ B is known as:
A. Conjunction
B. Disjunction
C. Literal
D. Negation
Correct Answer:
B
Chapter: 17
Q552:
Resolution works best when the expressions are in:
A. Canonical form
B. Disjunctive normal form
C. Conjunctive normal form
D. Negation normal form
Correct Answer:
C
Chapter: 17
Q553:
To convert (A → C) into CNF, the first step is:
A. Use distributive law
B. Eliminate implication
C. Negate conclusion
D. Resolve variables
Correct Answer:
B
Chapter: 17
Q554:
¬(A ∨ B) is equivalent to:
A. ¬A ∧ ¬B
B. ¬A ∨ ¬B
C. A ∨ B
D. ¬A ∧ B
Correct Answer:
A
Chapter: 17
Q555:
The expression (¬B ∨ C) is derived from which implication?
A. B → C
B. C → B
C. ¬C → B
D. A → C
Correct Answer:
A
Chapter: 17
Q556:
Resolution requires expressions in which of the following logical form?
A. Conjunctive normal form
B. Disjunctive normal form
C. Modus Tollens
D. Conjunctional inference
Correct Answer:
A
Chapter: 17
Q557:
The following is NOT a correct CNF clause:
A. A ∨ ¬B
B. B ∧ C
C. ¬A ∨ C
D. C ∨ B
Correct Answer:
B
Chapter: 17
Q558:
Resolution refutation is used to:
A. Verify truth tables
B. Derive contradictions to prove statements
C. Check syntax only
D. Convert to DNF
Correct Answer:
B
Chapter: 17
Q559:
In CNF conversion, De Morgan's Law is used to:
A. Distribute OR over AND
B. Eliminate variables
C. Move negations inward
D. Satisfy resolution
Correct Answer:
C
Chapter: 17
Q560:
The step ¬C is known as:
A. A clause
B. Goal expression
C. Negated conclusion
D. Disjunctive formula
Correct Answer:
C