Learning proofs for the classification of nilpotent semigroups
Carlos Simpson

TL;DR
This paper applies machine learning techniques to discover concise proofs for classifying 4-nilpotent semigroups, aiming to reduce proof complexity.
Contribution
It introduces a novel approach using machine learning to find minimal proofs in algebraic classification problems.
Findings
Successfully identified smaller proofs for 4-nilpotent semigroups
Demonstrated machine learning's effectiveness in algebraic proof discovery
Reduced proof size compared to traditional methods
Abstract
Machine learning is applied to find proofs, with smaller or smallest numbers of nodes, for the classification of 4-nilpotent semigroups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Machine Learning and Algorithms · Rough Sets and Fuzzy Logic
