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.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Unification and Resolution

  • Hantao Zhang,
  • Jian Zhang

摘要

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.