Guiding an automated theorem prover with neural rewriting (Q2104548)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Guiding an automated theorem prover with neural rewriting |
scientific article; zbMATH DE number 7628211
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Guiding an automated theorem prover with neural rewriting |
scientific article; zbMATH DE number 7628211 |
Statements
Guiding an automated theorem prover with neural rewriting (English)
0 references
7 December 2022
0 references
Kinyon and Veroff used Prover9 to search for the proof of the abelian inner mapping (AIM) conjecture, an open problem in quasigroup theory. In this paper, the authors improve its performance by using neural synthesis to suggest useful alternative formulations of the problem. They designed a method called 3SIL (stratified shortest solution imitation learning) which trains a neural predictor through a reinforcement learning loop to propose correct rewrites of the conjecture that guide the search. The authors trained 3SIL on a simpler task and demonstrated that it outperformed other reinforcement learning methods. They then trained 3SIL on the AIM benchmark and showed that the final trained network outperformed Prover9 and Waldmeister, another automated theorem prover, in solving the AIM problems. The combined system of 3SIL and Prover9 achieved a success rate of 90\%, which is 8.3\% higher than Prover9 alone in the same time. For the entire collection see [Zbl 1499.68012].
0 references
automated theorem proving
0 references
machine learning
0 references
abelian inner mapping
0 references
0.92231953
0 references
0 references
0.8732988
0 references
0.8593558
0 references
0 references
0.8440331
0 references