Complex Arguments in Adpositional Argumentation (talk)

Federico Gobbo presented joint work with Marco Benini and Jean Wagemans on Complex Arguments in Adpositional Argumentation during the 5^th Workshop on Advances in Argumentation in Artificial Intelligence (AI³ 2021) in Milano-Bicocca, Italy, 29 November 2021.

One of the topics in the upcoming paper with the same title is how to represent conclusions and premises that have been put into a chain, a structure that is known as ‘serial argumentation’. The authors solve this problem by introducing the omega operator (Ω) within the system of Adpositional Argumentation. This operator indicates the double function of the middle statement (ω) in serial argumentation: it functions as a premise (π₁) supporting the first statement (σ₁) and, at the same time, as a conclusion (σ₂) supported by the third statement (π₂). The accompanying argumentative adpositional tree (arg-adtree) thus comprises two arguments, which may be identified as different types in terms of the argument categorization framework of the Periodic Table of Argument (PTA) – represented as Pta₁ and Pta₂ in Figure 1 below.

The complete presentation can be found here: