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 5th Workshop on Advances in Argumentation in Artificial Intelligence (AI3 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 (π1) supporting the first statement (σ1) and, at the same time, as a conclusion (σ2) supported by the third statement (π2). 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 Pta1 and Pta2 in Figure 1 below.

Figure 1 – The Ω operator in the representation of serial argumentation

The complete presentation can be found here:

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s