The problem of definition expansion and contraction
Journal of Automated Reasoning
Gazing: an approach to the problem of definition and lemma use
Journal of Automated Reasoning
The Thirteen Books of Euclid's Elements, Books 1 and 2
The Thirteen Books of Euclid's Elements, Books 1 and 2
AI Communications - CASC
SRASS - A Semantic Relevance Axiom Selection System
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
System for Automated Deduction (SAD): A Tool for Proof Verification
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
The naproche project controlled natural language proof checking of mathematical texts
CNL'09 Proceedings of the 2009 conference on Controlled natural language
Hi-index | 0.00 |
Automated theorem provers (ATPs) struggle to solve problems with large sets of possibly superfluous axiom. Several algorithms have been developed to reduce the number of axioms, optimally only selecting the necessary axioms. However, most of these algorithms consider only single problems. In this paper, we describe an axiom selection method for series of related problems that is based on logical and textual proximity and tries to mimic a human way of understanding mathematical texts. We present first results that indicate that this approach is indeed useful.