Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture
Open Access
- 8 July 2026
- journal article
- research article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 70 (2) , 11
Abstract
The unsolved Andrews-Curtis conjecture in group theory gives rise to many famously challenging theorem-proving problems. Automated reasoning is one of the best state-of-the-art approaches to solving them. We have developed a new classifier inspired by group theory and a new search algorithm orientated at using for the Andrews-Curtis conjecture. We combine them with automated reasoning and compare their performance with automated reasoning.Keywords
This publication has 19 references indexed in Scilit:
- New Andrews–Curtis trivializations for Miller–Schupp group presentationsExamples and Counterexamples, 2024
- Learning Guided Automated Reasoning: A Brief Survey2024
- Recurrent Neural Networks2022
- Backwards Differentiation in AD and Neural Nets: Past Links and New Opportunities2006
- Recurrent Neural Networks Are Universal Approximators2006
- Varieties of Formal Languages1986
- A potential smooth counterexample in dimension 4 to the Poincare conjecture, the Schoenflies conjecture, and the Andrews-Curtis conjectureTopology, 1985
- Coproducts of crossed P-modules: Applications to second homotopy groups and to the homology of groupsTopology, 1984
- Automatic Differentiation: Techniques and Applications1981
- Probabilistic automataInformation and Control, 1963