Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is a resolution refutation's relationship to backward chaining?

  • A.Resolution is just backward chaining with the goal negated twice
  • B.Backward chaining is resolution restricted to definite clauses
  • C.The two are entirely different inference mechanisms
  • D.Backward chaining is a special case of forward chaining

Answer: B

Working backwards from a negated goal, resolving against definite clauses, is exactly what backward chaining does, which is why Prolog is described as a resolution based language. The restriction to definite clauses is what makes the search linear rather than exploding. The other options misstate the relationship. Seeing two apparently different procedures as one restricted to a fragment is what allows results about the general case to be applied to the special one.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.