Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.
: If the set of a clauses labeling the leaves of a resolution tree is satisfiable, then the clause at the root is satisfiable
): If the empty clause is derived from a set of clauses, then the set of clauses is unsatisfiable
) If a set of clauses is unsatisfiable, then the empty clause can be derived from it using resolution algorithm
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License