GADEL:: a Genetic Algorithm to compute default logic extensions

In the area of Default Logic, after many theoretical works, some operational systems are now able to deal with real world applications. However, due to the theoretical complexity of the problem, finding a default logic extension in a practical way is not yet possible in whole generality. Our work presents a new methodology to implement an automated default reasoning system based on Genetic Algorithms techniques. The aim of this paper is not to exhibit a program able to compute extensions of every kind of default theories in a minimal time, but to present a new promising approach of the problem. We provide here a formal description of the components required for a default logic extension search, based on Genetic Algorithms principles. We give also a formal result to ensure the correctness of our approach and some very interesting experimental results w.r.t. other existing systems.