ASGARD (Adaptive Steady state Genetic Algorithm for association Rule Discovery) is a genetic algorithm designed for rule mining.

A rule is a knowledge representation in the form:
IF cond_1 AND cond_2 ... AND cond_m THEN pred
This kind of rules contains two parts : the IF part which is called the rule condition and the THEN part which is called the rule prediction. The rule condition (C) contains a conjunction of $m$ conditions about values of predictor attributes. The rule prediction (P) contains the goal attribute.

Genetic Algorithm (GA) works by repeatedly modifying a population of artificial structures through the application of genetic operators. The goal is to find the best possible solution or, at least good, solutions for the problem.