A tutorial on assumption-based argumentation

We give an introductory tutorial to assumption-based argumentation (referred to as ABA) -a form of argumentation where arguments and attacks are notions derived from primitive notions of rules in a deductive system, assumptions and contraries thereof. ABA is equipped with different semantics for determining 'winning' sets of assumptions and - interchangeably and equivalently - 'winning'sets of arguments. It is also equipped with a catalogue of computational techniques to determine whether given conclusions can be supported by a 'winning' set of arguments. These are in the form of disputes between (fictional) proponent and opponent players, provably correct w.r.t. the semantics. Albeit simple, ABA is powerful in that it can be used to represent and reason with a number of problems in AI and beyond: non-monotonic reasoning, preferences, decisions. While doing so, it encompasses the expressive and computational needs of these problems while affording the transparency and explanatory power of argumentation.