Resolution Example in Artificial intelligence
Resolution is the process to prove a statement.
Resolution is a proof technique that works this way .
1.select two clauses that contain conflicting terms.
2. Combine those two clauses and cancel out the conflicting terms.

Steps in Resolution :
1. Converts facts into FOL
2. Converts FOL into CNF ( conjuctive Normal Form )
3. negate the statement to be proved , and add the result to the knowledge base.
4. Draw Resolution graph .

* find resolvable clauses and resolve them
* add results of resolution into the knowledge base .
* if empty clause (NIL) is produced , stop and report that original theorem is true .