Abstract Argumentation / Persuasion / Dynamics

Abstract

The act of persuasion, a key component in rhetoric argumentation, may be viewed as a dynamics modifier. We extend Dung's frameworks with acts of persuasion among agents, and consider interactions among attack, persuasion and defence that have been largely unheeded so far. We characterise basic notions of admissibilities in this framework, and show a way of enriching them through, effectively, CTL (computation tree logic) encoding, which also permits importation of the theoretical results known to the logic into our argumentation frameworks. Our aim is to complement the growing interest in coordination of static and dynamic argumentation.

Let’s Accept a Mission Impossible with Formal Argumentation, or Not

“…Compared to necessary and evidential support interpretations [13][14][15], our theory can deal with the desired causality relation generally, and can also cope with causality loops in computing acceptability semantics. Compared to (numerical) abstract persuasion argumentation [2,3], it handles causal dependency more concisely without needing a state transition system. Further, the causal-semantics have not been formulated in the dynamic argumentation theory, or in structured argumentation [11,12].…”

“…Two other formalisms seem able to model the above causality more closely. First, the dynamic relations as found in particular in [1,3] can express causal relation. Specifically, the theory allows generation (as well as elimination and alteration) of an argument from acceptable arguments.…”

Numerical Abstract Persuasion Argumentation for Expressing Concurrent Multi-Agent Negotiations

“…written alternatively as F (A 2 ) → Ax F (A 1 ) for some A x ⊆ A. Such A x the transition is dependent upon was termed a reference set in [7], but to make clearer its association to an agent, we call it an agent set instead.…”

“…To adapt to it, in this work we propose a novel argumentation-based negotiation framework. We base the development on abstract persuasion argumentation (APA) [7] which is a dynamic argumentation formalism that conservatively extends Dung abstract argumentation [10]. It accommodates a dynamic relation called persuasion in addition to attack relation (an argument a 1 attacks an argument a 2 ) of abstract argumentation.…”

“…1.1 Key contributions -Argumentation-based negotiation for interleaved negotiations: As far as we are aware, this is the first negotiation theory in the line of abstract argumentation [10] that adapts to interleaved multi-agent negotiations over scarce resources. -Finer control over dynamic transitions: While APA dynamics is already Turingcomplete [6], it does not mean that APA's interpretation of transition relation [7] (detail is in section 2.2) can deterministically simulate a handshake of two persuasions for a transition. Numerical APA consolidates the synchronisation, accommodating a finer control over how a dynamic transition takes place.…”