Resolution Theorem Provers


Automation for Interactive Proof: First Prototype

by Lawrence Paulson

Jia Meng, Claire Quigley and L. C. Paulson.
Automation for Interactive Proof: First Prototype. Information and Computation 204 10 (2006), 1575–1596.

Interactive theorem provers require too much effort from their users. We have been developing a system in which... more

Resolution Theorem Provers, Computational Logic, and Isabelle

8 views

Download (.pdf) (610kb) Quick view View on dx.doi.org

Source-level Proof Reconstruction for Interactive Theorem Proving

by Lawrence Paulson

L. C. Paulson and Kong Woei Susanto.
Source-level Proof Reconstruction for Interactive Theorem Proving. In: Klaus Schneider and Jens Brandt (editors), Theorem Proving in Higher Order Logics (Springer LNCS 4732, 2007), 232–245.

Interactive proof assistants should verify the proofs they receive from automatic theorem provers. Normally this proof... more

Isabelle, Computational Logic, and Resolution Theorem Provers
Download (.pdf) (381kb) Quick view View on dx.doi.org

Translating Higher-Order Clauses to First-Order Clauses

by Lawrence Paulson

With Jia Meng.
Translating Higher-Order Clauses to First-Order Clauses. J. Automated Reasoning 40 1 (2008), 35–60.

Interactive provers typically use higher-order logic, while automatic provers typically use first-order logic. In... more

Resolution Theorem Provers, Isabelle, and Computational Logic

2 views

Download (.pdf) (292kb) Quick view View on dx.doi.org

LEO-II — A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic

by Lawrence Paulson

Christoph Benzmüller, L. C. Paulson, Frank Theiss and Arnaud Fietzke.
LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic. In: Alessandro Armando, Peter Baumgartner, Gilles Dowek (editors), Automated Reasoning-4th International Joint Conference, IJCAR 2008 (Springer LNCS 5195, 2008), 162–170.

LEO-II is a standalone, resolution-based higher-order theorem prover designed for effective cooperation with... more

Computational Logic, Resolution Theorem Provers, and Higher-order logics

17 views

Seen by:
Download (.pdf) (140kb) Quick view View on dx.doi.org

Lightweight Relevance Filtering for Machine-Generated Resolution Problems

by Lawrence Paulson

With Jia Meng.
J. Applied Logic 7 1 (2009), 41-57.

Irrelevant clauses in resolution problems increase the search space, making proofs hard to find in a reasonable amount... more

Resolution Theorem Provers, Isabelle, and Computational Logic

3 views

Download (.pdf) (385kb) Quick view View on dx.doi.org

MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions

by Lawrence Paulson

With Behzad Akbarpour.
J. Automated Reasoning 44 3 (2010), 175–205.

Many theorems involving special functions such as ln, exp and sin can be proved automatically by MetiTarski: a... more

Computational Logic, Resolution Theorem Provers, and Real Analysis

28 views

Seen by:
Download (.pdf) (536kb) Quick view View on dx.doi.org
x

Log In

or reset password

Need an account? Click here to sign up

Reset Password

Enter the email address you signed up with, and we'll send a reset password email to that address

Academia © 2012