Experiments on Supporting Interactive Proof Using Resolution

Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be used for very different applications. This paper reports a series of experiments designed to determine whether resolution can support interactive proof as it is currently done. In particular, we present a sound and practical encoding in first-order logic of Isabelle's type classes.

• Type: Conference
• Year: 2004
• Where: CADE
• Authors: Jia Meng, Lawrence C. Paulson
• Keywords: Automated Reasoning, CADE 2004, Interactive Theorem Provers, Resolution Theorem Provers, Theorem Provers