Simple Contrapositive Assumption-Based Argumentation with Partially-Ordered Preferences.

We show that assumption-based argumentation frameworks, based on contrapositive logics and partially-ordered preference functions, provide a solid platform for argumentation-based representation and reasoning. Two useful properties of the preference functions are identified (selectivity and max-lower-boundedness), and extended forms of attacks relations are supported (∃-and ∀-attacks), which assure several desirable properties and a variety of reasoning modes.