{'fraction_non_alphanumeric': 0.007677543186180422, 'fraction_numerical': 0.0, 'mean_word_length': 5.96, '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}}
A Sound and Complete Dialectical Proof Procedure for Sceptical Preferred Argumentation

We present a dialectical proof procedure for computing skeptical preferred semantics in argumentation frameworks. The proof procedure is based on the dispute derivation introduced for assumption-based framework. We prove the soundness of the procedure for any argumentation frameworks and the completeness for a general class of finitary argumentation frameworks containing the class of finite argumentation frameworks as a subclass.