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

Discussion

Why is a resolution search space so large?

  • A.Every pair of clauses may resolve, producing yet more clauses
  • B.Each resolution step introduces new predicate symbols
  • C.Unification generates infinitely many substitutions
  • D.Clauses must be converted to normal form repeatedly

Answer: A

The set of clauses grows as resolvents are added, and each new clause may resolve with every existing one, so unrestricted search explodes immediately. That is why strategies restricting which pairs may resolve are essential rather than optional. No new predicates appear, the most general unifier is unique, and conversion happens once. A rule that is complete and unusable without restriction is the normal starting point for practical proof search. A single measurement chosen to respond to the one asymmetry beats several that respond to shared behaviour.

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

Post your comment

Please log in or register to post a comment.