Automatic construction and verification of isotopy invariants

  • Authors:

  • Volker Sorge;Andreas Meier;Roy McCasland;Simon Colton

  • Affiliations:

  • School of Computer Science, University of Birmingham, UK;DFKI GmbH, Saarbrücken, Germany;School of Informatics, University of Edinburgh, UK;Department of Computing, Imperial College, London, UK

  • Venue:
  • IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend our previous study of the automatic construction of isomorphic classification theorems for algebraic domains by considering the isotopy equivalence relation, which is of more importance than isomorphism in certain domains. 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 substructures. In addition, given the complexity of the theorems which 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 intricate interplay of computer algebra, model generation, theorem proving and satisfiability solving methods. To demonstrate the power of the approach, we generate an isotopic classification theorem for loops of size 6, which extends the previously known result that there are 22. This result was previously beyond the capabilities of automated reasoning techniques.