Abstract
AbstractNoting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combined system involving learning technology that generates useful lemmas for automated theorem provers, demonstrating improvement for several representative systems and solving a hard problem not solved by any system for twenty years. By focusing on condensed detachment problems we simplify the setting considerably, allowing us to get at the essence of lemmas and their role in proof search.
Publisher
Springer Nature Switzerland
Reference85 articles.
1. Alemi, A.A., Chollet, F., Een, N., Irving, G., Szegedy, C., Urban, J.: DeepMath – deep sequence models for premise selection. In: Lee, D., et al. (eds.) NIPS 2016, pp. 2243–2251. Curran Associates Inc., USA (2016). http://dl.acm.org/citation.cfm?id=3157096.3157347
2. Lecture Notes in Computer Science;OL Astrachan,1992
3. Bachmair, L., Ganzinger, H.: Resolution theorem proving. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol. 1, chap. 2, pp. 19–99. Elsevier (2001). https://doi.org/10.1016/B978-044450813-3/50004-7
4. Lecture Notes in Computer Science;P Baumgartner,1996
5. Benzmüller, C., Fuenmayor, D., Steen, A., Sutcliffe, G.: Who finds the short proof? Logic J. IGPL (2023). https://doi.org/10.1093/jigpal/jzac082
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献