Picking the right search strategy is important for the success of automatic theorem provers. E-MaLeS is a meta-system that uses machine learning and strategy scheduling to optimize the performance of the first-order theorem prover E. E-MaLeS applies a kernel-based learning method to predict the run-time of a strategy on a given problem and dynamically constructs a schedule of multiple promising strategies that are tried in sequence on the problem. This approach has significantly improved the performance of E 1.6, resulting in the second place of E-MaLeS 1.1 in the FOF divisions of CASC-J6 and CASC@Turing.
KeywordsStrategy Schedule Theorem Prover Automate Reasoning Automatic Mode Automatic Theorem Prover
Unable to display preview. Download preview PDF.
- 1.Alama, J., Heskes, T., Kühlwein, D., Tsivtsivadze, E., Urban, J.: Premise Selection for Mathematics by Corpus Analysis and Kernel Methods. CoRR abs/1108.3446 (2011); Accepted to JARGoogle Scholar
- 5.Korovin, K.: iProver - An Instantiation-Based Theorem Prover for First-Order Logic (System Description). Armando et al. , 292–298Google Scholar
- 10.Sörensson, N., Eén, N.: MiniSat 2.1 and MiniSat++ 1.0 SAT Race, Editions Technical Report, Chalmers University of Technology, Sweden (2008)Google Scholar
- 15.Urban, J., Sutcliffe, G., Pudlák, P., Vyskocil, J.: MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidanc. In: Armando et al. , pp. 441–456Google Scholar