Resolution

• Refutation Complete

  • Given an unsatisfiable KB in CNF,
  • Resolution will eventually deduce the empty clause

• Proof by Contradiction

  • To show ? ?= Q
  • Convert ? ? {?Q} to CNF
    • Conjunction of disjunctions (clauses)
  • Show result is unsatisfiable!

Previous slide

Next slide

Back to first slide

View graphic version