E (theorem prover)
E is a high-performance theorem prover for full first-order logic with equality. It is based on the equational superposition calculus and uses a purely equational paradigm. It has been integrated into other theorem provers and it has been among the best-placed systems in several theorem proving competitions. E is developed by Stephan Schulz, originally in the ''Automated Reasoning Group'' at TU Munich, now at Baden-Württemberg Cooperative State University Stuttgart. Provided by Wikipedia-
1by Vasilis Sourlas, Konstantinos Katsaros, Athanasios Xirofotos, Dimitrios Klonidis, Edoardo Bonetto, Daniele Brevi, Roberto Scopigno, Francesca Moscatelli, Markus Wimmer, Birger Haetty, Stephan Schulz, Amr Rizk, Michael Buchholz, Angelos AmditisGet access
Published 2021
Get access
Conference Object