Rationality and maximal consistent sets for a fragment of ASPIC + without undercut

• Published in: Argument & computation 2021-02, Vol.12 (1), p.3-47
• Main Authors: Heyninck, Jesse, Straßer, Christian
• Format: Article
• Language: English
• ISSN: 1946-2166; 1946-2174
• DOI: 10.3233/AAC-200903

Structured argumentation formalisms, such as ASPIC + , offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be expressed. This generality comes at the price that, in their most general form, formalisms such as ASPIC + do not satisfy important rationality postulates, such as non-interference. Similarly, links to other forms of knowledge representation, such as reasoning with maximal consistent sets of rules, are insufficiently studied for ASPIC + although such links have been established for other, less complex forms of structured argumentation where defeasible rules are absent. Clearly, for a formal model of defeasible reasoning it is important to understand for which range of parameters the formalism (a) displays a behavior that adheres to common standards of consistency, logical closure and logical relevance and (b) can be adequately described in terms of other well-known forms of knowledge representation. In this paper we answer this question positively for a fragment of ASPIC + without the attack form undercut by showing that it satisfies all standard rationality postulates of structured argumentation under stable and preferred semantics and is adequate for reasoning with maximal consistent sets of defeasible rules. The study is general in that we do not impose any other requirements on the strict rules than to be contrapositable and propositional and in that we also consider priorities among defeasible rules, as long as they are ordered by a total preorder and lifted by weakest link. In this way we generalize previous similar results for other structured argumentation frameworks and so shed further light on the close relations between assumption-based argumentation and ASPIC + .