The document discusses algorithms for enumerating preferred extensions in abstract argumentation frameworks. It compares the performance of four algorithms: AspartixM, NAD-Alg, PrefSAT, and SCC-P. It finds that algorithm selection based on graph features can accurately predict runtime, with up to 80% accuracy in classification, and improves performance over a single best solver by 2-3 times. Key discriminating features include density, number of arguments, number of strongly connected components, and features related to computing graph properties.