| Completeness
of Resolution |
|
|
|
|
|
|
|
|
|
|
|
| n | That is, that
resolution can decide the truth value |
|||||||||
| of S |
||||||||||
| n | S = set of
clauses |
|||||||||
| n | RC(S) = Resolution closure of S = Set of all |
|||||||||
| clauses that can
be derived from S by the |
||||||||||
| resolution
inference rule. |
||||||||||
| n | RC(S) has finite
cardinality (finite number of |
|||||||||
| symbols P1,
P2, … Pk), thus resolution refutation |
||||||||||
| must terminate. |
||||||||||
