Metis is an automated theorem prover based on ordered paramodulation. It is widely employed in the interactive theorem provers Isabelle/HOL and HOL4 to automate proofs as well as reconstruct proofs found by automated provers. For both these purposes, the tableaux-based MESON tactic is frequently used in HOL Light. However, paramodulation-based provers such as Metis perform better on many problems involving equality. We created a Metis-based tactic in HOL Light which translates HOL problems to Metis, runs an OCaml version of Metis, and reconstructs proofs in Metis ’ paramodulation calculus as HOL proofs. We evaluate the performance of Metis as proof reconstruction method in HOL Light
Abstract. PRocH3 is a proof reconstruction tool that imports in HOL Light proofs produced by ATPs on...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Abstract. This chapter describes our work on formal verification of floating-point algorithms using ...
Abstract. Reducing the distance between informal and formal proofs in interactive theorem proving is...
Abstract. We show how to encode the HOL Light logic in Coq. This makes an automatic translation of H...
Introduction The Isabelle/HOL environment [8] combines the power of au-tomated reasoning with higher...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
We present an algorithm for converting proofs from the OpenTheory interchange format, which can be t...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Abstract. Implementing proof reconstruction is difficult because it in-volves symbolic manipulations...
Abstract. There are two different approaches to formalizing proofs in a computer: the procedural app...
none3siWe present a proof-of-concept prototype of a (constructive variant of an) HOL interactive the...
This paper describes the core of an interactive theorem prover, "HOL Light", and a derivat...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Abstract. PRocH3 is a proof reconstruction tool that imports in HOL Light proofs produced by ATPs on...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Abstract. This chapter describes our work on formal verification of floating-point algorithms using ...
Abstract. Reducing the distance between informal and formal proofs in interactive theorem proving is...
Abstract. We show how to encode the HOL Light logic in Coq. This makes an automatic translation of H...
Introduction The Isabelle/HOL environment [8] combines the power of au-tomated reasoning with higher...
This techreport presents two approaches to primitive equality treatment in higher-order (HO) automat...
We present an algorithm for converting proofs from the OpenTheory interchange format, which can be t...
Abstract: Interactive theorem provers have developed dramatically over the past four decades, from p...
Isabelle/HOL is a generic proof assistant. Using Isabelle/HOL requires insight into procedures as we...
Abstract. Implementing proof reconstruction is difficult because it in-volves symbolic manipulations...
Abstract. There are two different approaches to formalizing proofs in a computer: the procedural app...
none3siWe present a proof-of-concept prototype of a (constructive variant of an) HOL interactive the...
This paper describes the core of an interactive theorem prover, "HOL Light", and a derivat...
Recently, a growing number of researchers have applied machine learning to assist users of interacti...
Abstract. PRocH3 is a proof reconstruction tool that imports in HOL Light proofs produced by ATPs on...
peer reviewedLeo-III is an automated theorem prover for extensional type theory with Henkin semantic...
Abstract. This chapter describes our work on formal verification of floating-point algorithms using ...