Most automated theorem provers suffer from the problem that they can produce proofs only
in formalisms difficult to understand even for experienced mathematicians. Effort has been …

This paper outlines an implemented system named PROVERB that transforms and abstracts
machine-found proofs to natural deduction style proofs at an adequate level of abstraction …

Most automated theorem provers suffer from the problem that the resulting proofs are difficult
to understand even for experienced mathematicians. Therefore, efforts have been made to …

Presenting machine-generated proofs in terms adequate to the needs of a human audience
is a serious challenge. One salient property of mathematical proofs as typically found in …

The Tramp system transforms the output of several automated theorem provers for first order
logic with equality into natural deduction proofs at the assertion level. Through this interface …

Abstract GAPT (General Architecture for Proof Theory) is a proof theory framework
containing data structures, algorithms, parsers and other components common in proof …

Current automatic theorem provers, particularly those based on some variant of resolution,
have concentrated on obtaining ever higher inference rates by using clever programming …

The existing examples of natural deduction proofs, either declarative or procedural, indicate
that often the legibility of proof scripts is of secondary importance to the authors. As soon as …

In automated theorem Poving different kinds of proof systems have been used. Traditional
proof systems, such as Hilbert-style proofs or natural deduction we call non-analytic, while …

In this paper a proof assistant called SAD is presented. SAD deals with mathematical texts
that are formalized in the ForTheL language (a brief description of which is also given) and …