Computing generating sets of minimal size in finite algebras (Q6108373)

The paper studies the problem of computing a generating set of a minimal size for a \textit{magma}, which is an algebra with a single operation. This problem can be solved using a SAT solver, but the corresponding instance encompasses the entire multiplication table of the algebra. The paper suggests instead a different algorithm, based on the CEGAR (counterexample guided abstraction refinement) paradigm. The algorithm is tested on the subclass of Moufang loops.