Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Multiple Choice Questions
Q541: Which proof strategy prefers clauses with one literal?
- A: Unit resolution
- B: Clause chaining
- C: Set of support
- D: Horn clause
View Answer
A
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
View Answer
B
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
View Answer
B
Q544: A variable or the negation of a variable is called a:
- A: Clause
- B: Unit
- C: Formula
- D: Literal
View Answer
D
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
View Answer
C
Q546: CNF expressions are evaluated based on:
- A: Disjunctions only
- B: Conjunctions of disjunctions
- C: Exclusive OR operations
- D: Simple conjunctions
View Answer
B
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
View Answer
C
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
View Answer
C
Q549: Each clause in CNF can be viewed as:
- A: A negation
- B: A requirement
- C: A variable
- D: An operator
View Answer
B
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
View Answer
C