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. © 2010 Springer-Verlag.
CITATION STYLE
Cramer, M., Koepke, P., Kühlwein, D., & Schröder, B. (2010). Premise selection in the naproche system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6173 LNAI, pp. 434–440). https://doi.org/10.1007/978-3-642-14203-1_37
Mendeley helps you to discover research relevant for your work.