We present here a new way to build a rational inference relation on a given finite set of defaults rules. This relation turns out to be free from the shortcomings that can be observed in most of the previous work done on defaults extensions, and problems like admissibility, inheritance property for exceptional subclasses, redundant rules or irrelevant propositions receive a satisfactory answer.