This paper discusses the usse of data-mining for the automatic formation of tactics. It was presented at the Workshop on Computer-Supported Mathematical Theory Development held at IJCAR in 2004. The aim of this project is to evaluate the applicability of data-mining techniques to the automatic formation of tactics from large corpuses of proofs. We data-mine information from large proof corpuses to find commonly occurring patterns. These patterns are then evolved into tactics using genetic programming techniques

Bundy, A.

Duncan, H.

Levine, J.

Pollet, M.

Storkey, A.

English

A classiﬁcation of abelian quasigroups,

Automating Algebra’s Tedious Tasks: Computerised Classiﬁcation,

B.: Secure two-way on-line communication by using Quasigroup Enciphering with almost public key,

Construction of quasigroups of huge order (in preparation)

Latin Squares and their Applications, English Univer.

Latin squares of order 10,

Mission Impossible: Find a Random Pseudorandom Number Generator,

On groupoids with identity x(xy)

On Inﬁnite Class of Strongly Collision Resistant Hash Functions

On quasigroup pseudo random sequence generator,Proc.

Potential of quaisgroups as PRSG

Quasigroup string processing and applications in cryptography,

Quasigroup string processing: Part 1,

Quasigroup string processing: Part 3,

Quasigroup string srocessing:

Random walk tests for pseudorandom number generators,

Secure two-way on-line communication by using Quasigroup Enciphering with almost public key,

Statistical tests for randomness using random walks on torus (in preparation)

Stream cipher based on quasigroup string transformations in

Stream cipher based on quasigroup string transformations in Z∗ p,

Using quasigroups for one-one secure encoding,

The use of data-mining for the automatic formation of tactics