Artificial Intelligence MCQs with Answers
Practice important Artificial Intelligence MCQs with answers and explanations.
Chapter: 16
Q521:
The statement "All men are mortal. Socrates is a man. So Socrates is mortal" uses __________ reasoning.
A. Abductive
B. Analogical
C. Inductive
D. Deductive
Correct Answer:
D
Chapter: 16
Q522:
When rules are applied to known statements to derive new ones, it is called a __________.
A. proof
B. engine
C. reasoning
D. system
Correct Answer:
A
Chapter: 17
Q523:
What is the required form for resolution to be applied in propositional logic?
A. Disjunctive normal form
B. Conjunctive normal form
C. Negation normal form
D. Canonical form
Correct Answer:
B
Chapter: 17
Q524:
A statement in conjunctive normal form (CNF) consists of:
A. ORs of ANDs
B. ANDs of ORs
C. ORs of literals
D. ANDs of variables
Correct Answer:
B
Chapter: 17
Q525:
Which of the following is a literal in CNF?
A. A ∧ B
B. ¬A ∨ B
C. A or ¬A
D. A ∧ ¬B
Correct Answer:
C
Chapter: 17
Q526:
In CNF, what is the term used for disjunctions of literals?
A. Literal
B. Clause
C. Statement
D. Proof
Correct Answer:
B
Chapter: 17
Q527:
The outermost structure in CNF is composed of:
A. Disjunctions
B. Negations
C. Conjunctions
D. Implications
Correct Answer:
C
Chapter: 17
Q528:
A literal is defined as:
A. A single variable only
B. A variable or its negation
C. A clause with multiple variables
D. Only a negated variable
Correct Answer:
B
Chapter: 17
Q529:
The rule to eliminate implications is used in which step of CNF conversion?
A. First step
B. Second step
C. Final step
D. Not required
Correct Answer:
A
Chapter: 17
Q530:
What law is applied to drive in negations during CNF conversion?
A. Associative Law
B. Distributive Law
C. De Morgan’s Law
D. Modus Ponens
Correct Answer:
C
Chapter: 17
Q531:
What should be done after eliminating implications and driving in negations during CNF conversion?
A. Negate the formula
B. Apply resolution directly
C. Distribute AND over OR
D. Distribute OR over AND
Correct Answer:
D
Chapter: 17
Q532:
In the clause (A ∨ ¬B), what type of formula is it?
A. Not a CNF clause
B. A clause in CNF
C. A literal
D. Resolution
Correct Answer:
B
Chapter: 17
Q533:
Which one of the following is NOT a valid step in CNF conversion?
A. Distribute OR over AND
B. Apply De Morgan’s Law
C. Eliminate implications
D. Distribute AND over OR
Correct Answer:
D
Chapter: 17
Q534:
In resolution by refutation, what is the first step?
A. Apply resolution
B. Negate the conclusion
C. Write all sentences in CNF
D. Derive contradiction
Correct Answer:
C
Chapter: 17
Q535:
In resolution refutation, contradiction implies:
A. Statement is invalid
B. Statement cannot be resolved
C. Statement is provable
D. Statement is false
Correct Answer:
C
Chapter: 17
Q536:
To prove a conclusion using resolution refutation, the conclusion must first be:
A. Assumed true
B. Negated
C. Written in DNF
D. Added as a premise
Correct Answer:
B
Chapter: 17
Q537:
Which of the following is TRUE about resolution refutation?
A. It always finds a proof
B. It does not need CNF
C. It works without contradiction
D. It tries to derive a contradiction
Correct Answer:
D
Chapter: 17
Q538:
In a resolution proof, each clause must be satisfied to prove:
A. The literal
B. The variable
C. The clause
D. The full statement
Correct Answer:
D
Chapter: 17
Q539:
(A → B) is logically equivalent to:
A. ¬A ∨ B
B. B ∧ A
C. ¬B ∨ A
D. A ∨ B
Correct Answer:
A
Chapter: 17
Q540:
If we have A ∨ B and ¬B ∨ C, what can be inferred using resolution?
A. A ∨ C
B. ¬A ∨ C
C. A ∨ ¬C
D. C ∨ B
Correct Answer:
A