We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as
objects in a global manner. In this first approach the formalism is restricted to first-order …

The paper analyses and compares on a high level of abstraction significant features of the
leading proof methods in Automated Theorem Proving. It aims at the identification of …

We show how variations of range-restriction and also the Horn property can be passed from
inputs to outputs of Craig interpolation in first-order logic. The proof system is clausal …

Human mathematicians are often good at recognizing modular and reusable theorems that
make complex mathematical results within reach. In this paper, we propose a novel method …

Provers based on the connection method can become much more powerful than currently
believed. We substantiate this thesis with certain generalizations of known techniques. In …

Exploring Metamath Proof Structures Page 1 Exploring Metamath Proof Structures Christoph
Wernhard 1 Zsolt Zombori 2 1University of Potsdam 2Alfréd Rényi Institute of Mathematics and …

Introduction We investigate learning to identify useful lemmas for ATP, where usefulness is
defined in terms of 1) reducing proof search and 2) shortening the length of the overall proof …

Abstract Hindsight Experience Replay is a promising technique in reinforcement learning.
However, we argue that its interpretation in refutational theorem proving is somewhat …