Abstract
MaLeS is an automatic tuning framework for automated theorem provers. It provides solutions for both the strategy finding as well as the strategy scheduling problem. This paper describes the tool and the methods used in it, and evaluates its performance on three automated theorem provers: E, LEO-II and Satallax. On a representative subset of the TPTP library a MaLeS-tuned prover solves on average 8.67 % more problems than the prover with its default settings.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Benzmüller, C., Paulson, L.C., Theiss, F., Fietzke, A.: LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) Automated Reasoning, Lecture Notes in Computer Science, vol. 5195, pp. 162–170. Springer (2008), doi:10.1007/978-3-540-71070-7_14
Bishop, C.M.: Pattern Recognition and Machine Learning. Information Science and Statistics. Springer (2006)
Bridge, J.P.: Machine learning and automated theorem proving. University of Cambridge, Computer Laboratory, Technical Report (792) (2010)
Brown, C.E.: Satallax: An Automatic Higher-Order Prover. In: Gramlich, B., Miller, D., Sattler, U. (eds.) Automated Reasoning, Lecture Notes in Computer Science, vol. 7364, pp. 111–117. Springer (2012), doi:10.1007/978-3-642-31365-3_11
Fuchs, M.: Automatic Selection Of Search-Guiding Heuristics For Theorem Proving. In: Proceedings of the 10th Florida AI Research Society Conference, pp. 1–5. Florida AI Research Society (1998)
Guyon, I., Elisseeff, A.: An introduction to variable and feature selection. J. Mach. Learn. Res. 3, 1157–1182 (2003)
Hutter, F., Hoos, H.H., Leyton-Brown, K., Stützle, T.: ParamILS: An Automatic Algorithm Configuration Framework. J. Artif. Intell. Res. 36, 267–306 (2009). doi:10.1613/jair.2861
Kühlwein, D., Schulz, S., Urban, J.: E-MaLeS 1.1. In: Bonacina, M.P. (ed.) Automated Deduction – CADE-24, Lecture Notes in Computer Science, vol. 7898, pp. 407–413. Springer (2013), doi:10.1007/978-3-642-38574-2_28
Kohavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: Proceedings of the 14th international joint conference on Artificial intelligence, vol. 2, pp. 1137–1143. Morgan Kaufmann Publishers Inc. (1995)
Kühlwein, D., Schulz, S., Urban, J.: Experiments with Strategy Learning for E Prover. In: 2nd Joint International Workshop on Strategies in Rewriting, Proving and Programming (2012)
Liu, H., Motoda, H.: Feature Selection for Knowledge Discovery and Data Mining. Kluwer Academic Publishers (1998)
Oliphant, T.E.: Python for scientific computing. Comput. Sci. Eng. 9(3), 10–20 (2007). doi:10.1109/MCSE.2007.58
Riazanov, A., Voronkov, A.: The design and implementation of VAMPIRE. AI Commun. 15(2-3), 91–110 (2002)
Rifkin, R., Yeo, G., Poggio, T.: Regularized least-squares classification. In: Suykens, J., Horvath, G., Basu, S., Micchelli, C., Vandewalle, J. (eds.) Advances in Learning Theory: Methods, Model and Applications, pp. 131–154. IOS Press, Amsterdam (2003)
Schulz, S.: E—A Brainiac Theorem Prover. J. AI Commun. 15(2-3), 111–126 (2002)
Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press (2004)
Sutcliffe, G.: The TPTP problem library and associated infrastructure. J. Autom. Reason. 43(4), 337–362 (2009). doi:10.1007/s10817-009-9143-8
Sutcliffe, G.: The CADE-22 Automated Theorem Proving System Competition - CASC-22. AI Commun. 23(1), 47–60 (2010)
Sutcliffe, G.: The 5th IJCAR Automated Theorem Proving System Competition - CASC-J5. AI Commun. 24(1), 75–89 (2011)
Sutcliffe, G.: The CADE-23 Automated Theorem Proving System Competition - CASC-23. AI Commun. 25(1), 49–63 (2012)
Sutcliffe, G.: The 6th IJCAR automated theorem proving system competition—CASC-J6. AI Commun. 26(2), 211–223 (2013)
Sutcliffe, G., Benzmüller, C.: Automated reasoning in higher-order logic using the TPTP THF infrastructure. J. Formalized Reason. 3(1), 1–27 (2010)
Sutcliffe, G., Suttner, C.: Evaluating General Purpose Automated Theorem Proving Systems. Artif. Intell. 131(1-2), 39–54 (2001). doi:10.1016/S0004-3702(01)00113-8
Tammet, T.: Gandalf. J. Autom. Reason. 18, 199–204 (1997). doi:10.1023/A:1005887414560
Urban, J.: BliStr: The Blind Strategymaker. CoRR (2013). arXiv:1301.2683
Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, New York (1995)
Wolf, A.: Strategy selection for automated theorem proving. In: Giunchiglia, F. (ed.) Artificial Intelligence: Methodology, Systems, and Applications, Lecture Notes in Computer Science, vol. 1480, pp. 452–465. Springer (1998), doi:10.1007/BFb0057466
Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: SATzilla: Portfolio-based Algorithm Selection for SAT. J. Artif. Intell. Res. 32, 565–606 (2008). doi:10.1613/jair.2490
Author information
Authors and Affiliations
Corresponding author
Electronic supplementary material
Below is the link to the electronic supplementary material.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
About this article
Cite this article
Kühlwein, D., Urban, J. MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers. J Autom Reasoning 55, 91–116 (2015). https://doi.org/10.1007/s10817-015-9329-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10817-015-9329-1