z-logo
open-access-imgOpen Access
Experiments on Supporting Interactive Proof Using Resolution
Author(s) -
Meng Jia,
Lawrence C. Paulson
Publication year - 2004
Publication title -
lecture notes in computer science
Language(s) - English
Resource type - Book series
SCImago Journal Rank - 0.249
H-Index - 400
eISSN - 1611-3349
pISSN - 0302-9743
DOI - 10.1007/978-3-540-25984-8_28
Subject(s) - computer science , resolution (logic) , automated theorem proving , encoding (memory) , programming language , proof assistant , theoretical computer science , algorithm , artificial intelligence , mathematical proof , mathematics , geometry
Interactive theorem provers can model complex systems, but require much eort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be used for very dif- ferent 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 rst-order logic of Isabelle's type classes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom