The Elfe System - Verifying mathematical proofs of undergraduate students

@inproceedings{Dor2018TheES,
  title={The Elfe System - Verifying mathematical proofs of undergraduate students},
  author={Maximilian Dor{\'e} and Krysia Broda},
  booktitle={CSEDU},
  year={2018}
}
Elfe is an interactive system for teaching basic proof methods in discrete mathematics. The user inputs a mathematical text written in fair English which is converted to a special data-structure of first-order formulas. Certain proof obligations implied by this intermediate representation are checked by automated theorem provers which try to either prove the obligations or find countermodels if an obligation is wrong. The result of the verification process is then returned to the user. Elfe is… 
Intuitive Reasoning in Formalized Mathematics with Elfe
TLDR
The inner workings of Elfe are presented and how it can be used to prove lemmas in synthetic geometry and the system is compared to other approaches to formalized mathematics to give an outlook where the development may lead.
Towards Intuitive Reasoning in Axiomatic Geometry
TLDR
The interactive theorem prover Elfe accepts mathematical texts written in fair English and verifies them with the help of ATP, allowing for teaching axiomatic geometry to students without prior experience in formalized mathematics.
Towards Intuitive Reasoning in Axiomatic Geometry 2
TLDR
The interactive theorem prover ELFE accepts mathematical texts written in fair English and verifies them with the help of ATP, leaving only the cornerstones of a proof to be derived by the user.

References

SHOWING 1-10 OF 20 REFERENCES
LFE – An interactive theorem prover for undergraduate students
TLDR
ELFE is an interactive theorem prover with an easy to use language and user interface that allows the system to be used in teaching basic proof methods in discrete Mathematics.
First-Order Logic and Automated Theorem Proving
  • M. Fitting
  • Computer Science
    Graduate Texts in Computer Science
  • 1996
TLDR
This monograph on classical logic presents fundamental concepts and results in a rigorous mathematical style and is intended for those interested in computer science and mathematics at the beginning graduate level.
The Higher-Order Prover Leo-II
TLDR
It is crucial that Leo-II returns proof information in a standardised syntax, so that these proofs can eventually be transformed and verified within proof assistants.
System for Automated Deduction (SAD): A Tool for Proof Verification
TLDR
A proof assistant called SAD deals with mathematical texts that are formalized in the ForTheL language and checks their correctness and a series of examples that show what can be done with it are given.
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
TLDR
This presentation discusses Functional Programming in HOL, which aims to provide students with an understanding of the programming language through the lens of Haskell.
E - a brainiac theorem prover
TLDR
E is a sound and complete prover for clausal first order logic with equality and has a very flexible interface for specifying search control heuristics, and an efficient inference engine.
Beagle - A Hierarchic Superposition Theorem Prover
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on
The Naproche Project: Controlled Natural Language Proof Checking of Mathematical Texts
This paper discusses the semi-formal language of mathematics and presents the Naproche CNL, a controlled natural language for mathematical authoring. Proof Representation Structures, an adaptation of
S PASS Version 2.0
TLDR
This system description provides an overview of recent developments in Spass 2.0, including among others an implementation of contextual rewriting, refinements of the clause normal form transformation, and enhancements of the inference engine.
The design and implementation of VAMPIRE
TLDR
This article describes VAMPIRE: a high-performance theorem prover for first-order logic and focuses on the design of the system and some key implementation features.
...
...