A computational logic handbook
A computational logic handbook
CADE-10 Proceedings of the tenth international conference on Automated deduction
Logic and computation in MATHPERT: an expert system for learning mathematics
Proceedings of the third conference on Computers and mathematics
Some applications of Gentzen's proof theory in automated deduction
Proceedings of the international workshop on Extensions of logic programming
Extending the HOL Theorem Prover with a Computer Algebra System to Reason about the Reals
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Automatic Generation of Epsilon-Delta Proofs of Continuity
AISC '98 Proceedings of the International Conference on Artificial Intelligence and Symbolic Computation
Analytica - A Theorem Prover in Mathematica
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Unification in Lambda-Calculi with if-then-else
CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
A Second-Order Theorem Prover Applied to Circumscription
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
MetiTarski: An Automatic Prover for the Elementary Functions
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions
Journal of Automated Reasoning
Extending a resolution prover for inequalities on elementary functions
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Reductio ad absurdum: planning proofs by contradiction
Reasoning, Action and Interaction in AI Theories and Systems
| Hi-index | 0.00 |
As part of a project on automatic generation of proofs involving both logic and computation, we have automatically generated a proof of the irrationality of e. The proof involves inequalities, bounds on infinite series, type distinctions (between real numbers and natural numbers), a subproof by mathematical induction, and significant mathematical steps, including correct simplification of expressions involving factorials and summing an infinite geometrical series. Metavariables are instantiated by inference rules embodying mathematical knowledge, rather than only by unification. The proof is generated completely automatically, without any interactive component.