Unification and Resolution
摘要
After the presentation of the rule-based unification algorithm, a practically linear time unification algorithm is presented in detail. Then the chapter describes resolution as a refutational proof procedure for first-order logic. After the presentation of three simplification orders over terms and literals, the completeness of ordered resolution is shown. Some examples are given, using McCune’s Prover9.