Abstract
E is an equational theorem prover for full first-order logic, based<br/>on superposition and rewriting. In this preliminary manual we first<br/>give a short introduction for impatient new users, and then cover<br/>calculus and proof procedure. The manual covers proof search control<br/>and related options, followed by input and output formats. Finally,<br/>it describes some additional tools that are part of the E<br/>distribution.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Diverse Machine Translation with Translation Memory;2022 International Joint Conference on Neural Networks (IJCNN);2022-07-18
2. MANI-Rank: Multiple Attribute and Intersectional Group Fairness for Consensus Ranking;2022 IEEE 38th International Conference on Data Engineering (ICDE);2022-05
3. Faster, Higher, Stronger: E 2.3;Lecture Notes in Computer Science;2019