{'fraction_non_alphanumeric': 0.02219626168224299, 'fraction_numerical': 0.009345794392523364, 'mean_word_length': 5.348148148148148, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Computing stable semantics of AF by 0–1 integer programming

Dung's abstract argumentation frameworks has been object of intense study not just for its relationship with logical reasoning but also for its uses within artificial intelligence. One research branch in abstract argumentation has focused on finding new methods for computing its different semantics. We conducted a performance comparison, computing stable semantics of argumentation frameworks, between two answer set approaches and a third one based on 0-1 integer programming using instances from the ASPARTIX project. To this end, it was developed a 0-1 integer program for computing the stable semantics. This work presents the results of the experiment, the 0-1 integer model and explains it in terms of Dung's abstract argumentation notions, such as conflict-freeness, admissibility, etc.