Skip to main content
Log in

Automatic Construction and Verification of Isotopy Invariants

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation. Isotopism is an important generalisation of isomorphism, and is studied by mathematicians in domains such as loop theory. This extension was not straightforward, and we had to solve two major technical problems, namely, generating and verifying isotopy invariants. Concentrating on the domain of loop theory, we have developed three novel techniques for generating isotopic invariants, by using the notion of universal identities and by using constructions based on subblocks. In addition, given the complexity of the theorems that verify that a conjunction of the invariants form an isotopy class, we have developed ways of simplifying the problem of proving these theorems. Our techniques employ an interplay of computer algebra, model generation, theorem proving, and satisfiability-solving methods. To demonstrate the power of the approach, we generate isotopic classification theorems for loops of size 6 and 7, which extend the previously known enumeration results. This work was previously beyond the capabilities of automated reasoning techniques.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Aschbacher, M.: The status of the classification of finite simple groups. Notices of the AMS 51(7), 736–740 (2004)

    MATH  MathSciNet  Google Scholar 

  2. Barrett, C., Berezin, S.: CVC Lite: a new implementation of the cooperating validity checker. In: Alur, R., Peled, D. (eds.) Computer Aided Verification, 16th International Conference, CAV 2004. LNCS, vol. 3114, pp. 515–518. Springer, Boston, MA (2004)

    Google Scholar 

  3. Bundy, A.: Cooperating Reasoning Processes: more than just the sum of their parts. In: Twentieth International Joint Conference on Artificial Intelligence, pp. 2–11 (2007)

  4. Chou, S.: Proving and discovering geometry theorems using Wu’s method. Technical Report 49, Computing Science, University of Austin at Texas (1985)

  5. Colton, S.: Automated Theory Formation in Pure Mathematics. Springer (2002).

  6. Colton, S., Meier, A., Sorge, V., McCasland, R.: Automatic generation of classification theorems for finite algebras. In: Basin, D., Rusinowitch, M. (eds.) Automated Reasoning – 2nd International Joint Conference, IJCAR 2004. LNAI, vol. 3097, pp. 400–414. Cork, Ireland (2004)

  7. Colton, S., Muggleton, S.: Mathematical applications of inductive logic programming. Mach. Learn. 64, 25–64 (2006)

    Article  MATH  Google Scholar 

  8. Falconer, E.: Isotopy invariants in quasigroups. Trans. Am. Math. Soc. 151(2), 511–526 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  9. Ganzinger, H., Hagen, G., Nieuwenhuis, R., Oliveras, A., Tinelli, C.: DPLL(T): fast decision procedures. In: Alur, R., Peled, D. (eds.) Computer Aided Verification, 16th International Conference, CAV 2004. LNCS, vol. 3114, pp. 175–188. Springer, Boston, MA (2004)

    Google Scholar 

  10. GAP: GAP – Groups, Algorithms, and Programming, Version 4.3. The GAP Group. http://www.gap-system.org (2002)

  11. Kronecker, L.: Auseinandersetzung einiger eigenschaften der klassenanzahl idealer komplexer zahlen, pp. 881–889. Monatsbericht der Berliner Akademie (1870)

  12. Kunen, K.: Single axioms for groups. J. Autom. Reason. 9(3), 291–308 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Manna, Z., Zarba, C.: Combining decision procedures. In: Formal Methods at the Cross Roads: From Panacea to Foundational Support, Lecture Notes in Computer Science. Springer (2003)

  14. McCune, W.: Automated discovery of new axiomatizations of the left group and right group calculi. J. Autom. Reason. 9(1), 1–24 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  15. McCune, W.: Single axioms for groups and Abelian groups with various operations. J. Autom. Reason. 10(1), 1–13 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. McCune, W.: Mace4 reference manual and guide. Argonne National Laboratory. ANL/MCS-TM-264 (2003)

  17. McKay, B.D., Meynert, A., Myrvold, W.: Counting small latin squares. In: European Women in Mathematics International Workshop on Groups and Graphs, pp. 67–72. Varna, Bulgaria (2002)

  18. Meier, A., Sorge, V.: Applying SAT solving in classification of finite algebras. J. Autom. Reason. 35(1–3), 201–235 (2005)

    MATH  MathSciNet  Google Scholar 

  19. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. of the 39th Design Automation Conference (DAC 2001), pp. 530–535. Las Vegas, NV (2001)

  20. Pflugfelder, H.O.: Quasigroups and Loops: Introduction, Vol. 7 of Sigma Series in Pure Mathematics. Berlin, Germany: Heldermann Verlag (1990)

    Google Scholar 

  21. Riazanov, A., Voronkov, A.: Vampire 1.1. In: Goré, R., Leitsch, A., Nipkow, T. (eds.) Automated Reasoning – 1st International Joint Conference, IJCAR 2001. LNAI, vol. 2083, pp. 376–380. Siena, Italy (2001)

  22. Schulz, S.: E: A Brainiac theorem prover. J. AI Commun. 15(2–3), 111–126 (2002)

    MATH  Google Scholar 

  23. Schwenk, J.: A classification of Abelian quasigroups. Rendiconti di Matematica, Serie VII 15, 161–172 (1995)

    MATH  MathSciNet  Google Scholar 

  24. Slaney, J.: FINDER, Notes and Guide. Center for Information Science Research, Australian National University (1995)

  25. Slaney, J., Fujita, M., Stickel, M.: Automated reasoning and exhaustive search: quasigroup existence problems. Comput. Math. Appl. 29, 115–132 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  26. Sorge, V., Meier, A., McCasland, R., Colton, S.: The automatic construction of isotopy invariants. In: Third International Joint Conference on Automated Reasoning (2006)

  27. Sutcliffe, G.: The IJCAR-2004 automated theorem proving competition. AI Commun. 18(1), 33–40 (2005)

    MathSciNet  Google Scholar 

  28. Weidenbach, C., Brahm, U., Hillenbrand, T., Keen, E., Theobald, C., Topic, D.: SPASS version 2.0. In: Voronkov, A. (ed.) Proc. of the 18th International Conference on Automated Deduction (CADE–18). LNAI, vol. 2392, pp. 275–279 (2002)

  29. Wu, W.: Basic principles of mechanical theorem proving in geometries. J. Syst. Sci. Math. Sci. 4(3), 207–235 (1984)

    Google Scholar 

  30. Zhang, J., Zhang, H.: SEM User’s Guide. Department of Computer Science, University of Iowa (2001)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Simon Colton.

Additional information

The author’s work was supported by EPSRC MathFIT grant GR/S31099.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sorge, V., Meier, A., McCasland, R. et al. Automatic Construction and Verification of Isotopy Invariants. J Autom Reasoning 40, 221–243 (2008). https://doi.org/10.1007/s10817-007-9093-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10817-007-9093-y

Keywords

Navigation