作者: Jia Meng , Lawrence C. Paulson
DOI: 10.1007/978-3-540-25984-8_28
关键词: Algorithm 、 Logical programming 、 Proof theory 、 Automated theorem proving 、 Resolution (logic) 、 Computer science 、 Conjunctive normal form 、 First-order logic 、 Programming language 、 Automated reasoning
摘要: Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution are automatic and powerful, they designed be used for very different applications. This paper reports a series of experiments determine whether resolution support interactive proof as it is currently done. In particular, we present sound practical encoding in first-order logic Isabelle’s type classes.