 In 2006, answer set declarative programming was used for superoptimising in the Total Optimisation using Answer Set Technology (TOAST) project at the University of Bath, and superoptimizing was used to automatically generate general-purpose peephole optimizers.Typically, superoptimizing is performed via exhaustive brute-force search in the space of valid instruction sequences.This is a costly method, and thus impractical for general-purpose compilers.