Algebra and automated deduction

  • Steve Linton
  • Ursula Martin
  • Péter Pröhle
  • Duncan Shand
Session 6B
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1104)


This paper develops links between algebra and automated deduction. We show how we have developed heuristics in automated deduction and computer algebra systems by looking at Tietze transformations from group theory and Knuth-Bendix completion. A complex induction proof of a theorem about a wreath product of two groups is developed with the aid of the Larch Prover in order to show how algebraic problems can be attacked with an automated theorem prover. We then present an automated solution of the 7th problem of Schweitzer'95.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    A complete LP transcript of the session is available electronically. The files can be obtained by anonymous FTP from in the directory/pub/Papers/CADE13/. The system LP can be obtained from [8].Google Scholar
  2. 2.
    Aschbacher, M.: Finite Group Theory, Cambridge Studies in Advanced Mathematics 10, Cambridge 1986.Google Scholar
  3. 3.
    Book, R., and Otto, F.: String Rewriting Systems, Texts and Monographs in Computer Science series, Springer Verlag, 1993.Google Scholar
  4. 4.
    Burris, S., Sankappanavar, H.P.: A course in universal algebra, GTM 78, Springer Verlag, 1981Google Scholar
  5. 5.
    Campbell, C.: lecture notes from Computational Group Theory course, St Andrews, 1994.Google Scholar
  6. 6.
    Dershowitz, N.: Orderings for Term Rewriting Systems, Theoretical Computer Science 17, 1992, pp. 279–301.CrossRefGoogle Scholar
  7. 7.
    Dershowitz, N., Kaplan, S., Plaisted, D.: Rewrite, Rewrite, Rewrite, Rewrite, Rewrite ..., Theoretical Computer Science 83, (1991), pp. 71–96.CrossRefGoogle Scholar
  8. 8.
    Garland, S.J., Guttag, J.V.: An Overview of LP, The Larch Prover, Proc Rewriting Techniques and Applications, 3rd Intl Conference, LNCS 355 (1989) 137–151. LP can be obtained by anonymous ftp in /pub/Larch/ at Scholar
  9. 9.
    Gilman: Presentations of Groups and Monoids, Journal of Algebra 57, (1979), pp. 544–554.CrossRefGoogle Scholar
  10. 10.
    Havas, G., Kenne, P.E., Richardson, J.S. and Robertson, E.F.: A Tietze Transformation Program, (ed.) M.D. Atkinson, Computational Group Theory, Academic Press, London, 1984, pp. 69–73.Google Scholar
  11. 11.
    Hall, P.: A contribution to the theory of groups of prime-power order, Proc. London Math. Soc. (2) 36 (1933) pp. 29–55.Google Scholar
  12. 12.
    Holt, D.F.: Knuth-Bendix in Monoids, and Automatic Groups (a package of programs), Mathematics Institute, University of Warwick, England, 1995. The file kbmag.tar.Z can be obtained by anonymous ftp in /people/dfh/ at This system is also available as a GAP share package in /pub/incoming/ at Scholar
  13. 13.
    Jantzen, M., Confluent String Rewriting, EATCS Monograph 14, Springer-Verlag, 1988.Google Scholar
  14. 14.
    Johnson, D.L.: Presentations of Groups, Cambridge University Press, Cambridge, 1990.Google Scholar
  15. 15.
    Ledermann, W.: Introduction to Group Theory, Longman 1973.Google Scholar
  16. 16.
    Linton, S., and Shand, D.: Some Group Theoretic Examples with Completion Theorem Provers, to appear in Journal of Automated Reasoning.Google Scholar
  17. 17.
    McKenzie, R.N., McNulty, G.F., Taylor, W.F.: Algebras, lattices, varieties, The Wadsworth and Brooks/Cole Advanced Books and Software, 1987.Google Scholar
  18. 18.
    Needham, R.E.: Infinite complete group presentations, preprint (1994), Department of Mathematics of The City College of The City University of New York.Google Scholar
  19. 19.
    Robinson, D.J.S.: A course in the Theory of Groups, GTM 80 (1982) pp. 119–120.Google Scholar
  20. 20.
    Schönert, M., et. al.: GAP — Groups, Algorithms, and Programming, Lehrstuhl D für Mathematik, RWTH Aachen, Germany, 1992. GAP can be obtained by anonymous ftp in /pub/gap/ at Scholar
  21. 21.
    Sims, C.C.: Computation with Finitely Presented Groups, Cambridge University Press, Cambridge, 1994.Google Scholar
  22. 22.
    Sims, C.C.: Verifying Nilpotence, Journal of Symbolic Computation 3, (1987), pp. 231–247.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Steve Linton
    • 1
  • Ursula Martin
    • 1
  • Péter Pröhle
    • 1
    • 2
  • Duncan Shand
    • 1
  1. 1.Computer Science DivisionUniversity of St AndrewsNorth Haugh, St AndrewsScotland
  2. 2.Depth. of Algebra and Numbertheory, Faculty of Natural SciencesEötvös Loránd UniversityBudapestHungary

Personalised recommendations