The Basis of Proof by Resolution

Resolution is used to prove that a given set of clauses is inconsistent. (i.e., it cannot have a model).

Each time a resolvent is formed, it is added to the set of clauses. This does not change the consistency of the set.

However, if the null clause is ever added to the set, then it becomes very obvious that the set is inconsistent.

Previous slide

Back to first slide

View graphic version