Genetic Algorithm for finding minimal explanations

This paper presents a genetic algorithm for solving the NP-hard problem of finding a minimal explanation. We compare the performance of the algorithm to the fastest known heuristic exhaustive search deterministic algorithms, and show that genetic algorithms are a promising approach for this type of problem, being faster than deterministic algorithms especially for problem instances where the proof graph of the knowledge base is highly connected (where deterministic algorithms tend to do badly).