Resolution is a theorem prover method which is sound and complete. It works by converting the premises and conclusions to clause expressions or clausal form.
What resolution method says is,
It means, if two clauses having a literal and its negate, then we can combine all those clauses by removing those complementary pair.
Important
Empty clause means that the set of clauses are unsatisfiable. This property will be used one the applications (proving the unsatisfiability).
Common Resolutions
1. Modus Ponens
This is can be done using resolution method.