Login
Remember
Register
Ask a Question
When the resolution is called as refutation-complete?
+1
vote
asked
Oct 26, 2021
in
Artificial Intelligence
by
DavidAnderson
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
The question was asked in an online quiz.
The doubt is from Resolution in portion Logical Agents of Artificial Intelligence
Select the correct answer from above options
Interview Questions and Answers, Database Interview Questions and Answers for Freshers and Experience
artificial-intelligence
other-ai-algorithms-&-statistics-artificial
intelligence-algorithms
Please
log in
or
register
to answer this question.
1
Answer
0
votes
answered
Oct 26, 2021
by
DavidAnderson
Correct answer is (b) Sentence is unsatisfiable
For explanation I would say: Resolution is refutation-complete, if a set of sentence is unsatisfiable, then resolution will always be able to derive a contradiction.
...