Analysis of Dialogical Argumentation via Finite State Machines

Dialogical argumentation is an important cognitive activity by which agents exchange arguments and counterarguments as part of some process such as discussion, debate, persuasion and negotiation. Whilst numerous formal systems have been proposed, there is a lack of frameworks for implementing and evaluating these proposals. First-order executable logic has been proposed as a general framework for specifying and analysing dialogical argumentation. In this paper, we investigate how we can implement systems for dialogical argumentation using propositional executable logic. Our approach is to present and evaluate an algorithm that generates a finite state machine that reflects a propositional executable logic specification for a dialogical argumentation together with an initial state. We also consider how the finite state machines can be analysed, with the minimax strategy being used as an illustration of the kinds of empirical analysis that can be undertaken.Comment: 10 page

Meta-Argumentation Frameworks for Multi-party Dialogues

Postprin

A Compact Argumentation System for Agent System Specification

We present a non-monotonic logic tailored for specifying compact autonomous agent systems. The language is a consistent instantiation of a logic based argumentation system extended with Brooks' subsumption concept and varying degree of belief. Particularly, we present a practical implementation of the language by developing a meta-encoding method that translates logical specifications into compact general logic programs. The language allows n-ary predicate literals with the usual first-order term definitions. We show that the space complexity of the resulting general logic program is linear to the size of the original theory

Burden of persuasion in argumentation: A meta-argumentation approach

This paper examines the view of the burden of persuasion as meta argument and elaborates the meta-argumentative aspects of a burden-of-persuasion semantics in argumentation. An argumentation framework composed of a meta level (dealing with the burden) and an object level (dealing with standard arguments) is proposed and discussed, and its equivalence with the burden-of-persuasion model in argumentation is proved. Finally, a computationally-feasible implementation of the meta-argumentation approach is presented

A Study of AIF Argument Networks Anomalies and a Characterization of its Solutions

The Argument Interchange Format (AIF) is a communal project with the purpose of developing a way of interchanging data between tools for argument manipulation and visualization. The AIF project also aims to develop a commonly agreed upon core ontology that specifies the basic concepts used to express arguments and their mutual relations. However, the flexibility provided by the AIF core ontology may lead to ambiguous or undesired interpretations. If ambiguous and anomalous situations are allowed, the purpose of using AIF as a common lingua for the research and development of argumentation systems might be jeopardized. The goal of this work is to identify anomalies that can arise and propose solutions for them.Sociedad Argentina de Informática e Investigación Operativ

Arguing about the existence of conflicts

In this paper we formalise a meta-argumentation framework as an ASPIC+ extension which enables reasoning about conflicts between formulae of the argumentation language. The result is a standard abstract argumentation framework that can be evaluated via grounded semantics

Burden of persuasion in argumentation : a meta-argumentation approach

Published online: 14 February 2022This paper examines the view of the burden of persuasion as meta argument and elaborates the meta-argumentative aspects of a burden-of-persuasion semantics in argumentation. An argumentation framework composed of a meta level (dealing with the burden) and an object level (dealing with standard arguments) is proposed and discussed, and its equivalence with the burden-of-persuasion model in argumentation is proved. Finally, a computationally-feasible implementation of the meta-argumentation approach is presented