Structural Constraints for Dynamic Operators in Abstract Argumentation

  title={Structural Constraints for Dynamic Operators in Abstract Argumentation},
  author={Johannes Peter Wallner},
Many recent studies of dynamics in formal argumentation within AI focus on the well-known formalism of Dung’s argumentation frameworks (AFs). Despite the usefulness of AFs in many areas of argumentation, their abstract notion of arguments creates a barrier for operators that modify a given AF, e.g., in the case that dependencies between arguments have been abstracted away that are important for subsequent modifications. In this paper we aim to support development of dynamic operators on formal… 

Figures and Tables from this paper

Explaining Non-Acceptability in Abstract Argumentation
The resulting system is thus able to deliver explanations also in the case of non-acceptance and is provided a first empirical study that shows the feasibility of this approach.
Investigating Subclasses of Abstract Dialectical Frameworks
This work introduces certain subclasses of ADFs and investigates their properties, and shows that for acyclic ADFs, the different semantics coincide and that even for SETAFs symmetry is less powerful than for AFs.
Investigating subclasses of abstract dialectical frameworks
This work introduces certain subclasses of ADFs and investigates their properties, and shows that for acyclic ADFs, the different semantics coincide and that even for SETAFs symmetry is less powerful than for AFs.
Strong admissibility for abstract dialectical frameworks
This work presents the concept of strong admissibility of interpretations of interpretations for ADFs and shows that strongly admissible interpretations of ADFs form a lattice with the grounded interpretation as top element.
Reasoning over Argument-Incomplete AAFs in the Presence of Correlations
We introduce argument-incomplete Abstract Argumentation Frameworks with dependencies, that extend the traditional abstract argumentation reasoning to the case where some arguments are uncertain and
Enforcing Sets of Formulas in Structured Argumentation
This paper study conditions on the argumentation setting and the knowledge base that ensure (or prevent) the acceptability of sets of formulas for structured argumentation frameworks.
On the Expressive Power of Collective Attacks
This paper considers SETAFs due to Nielsen and Parsons, an exten-sion of Dung’s abstract argumentation frameworks that allow for collective attacks, and shows thatSETAFs are strictly more expressive than Dung AFs.


Extension Removal in Abstract Argumentation - An Axiomatic Approach
An axiomatic approach to the removal problem is developed, i.e. a certain set of axioms will determine suitable manipulations and conditional and unconditional existence and semantical uniqueness of removal operators as well as various impossibility results are proved.
Revision of Abstract Dialectical Frameworks : Preliminary Report ∗
This work studies AGM-style revision operators for ADFs by providing various representation results and presents an alternative family of operators based on a variant of the postulates considering preferred interpretations of the original and admissibleinterpretations of the revising ADF.
Characteristics of multiple viewpoints in abstract argumentation
Synthesizing Argumentation Frameworks from Examples
This work proposes and study the AF synthesis problem as a natural extension of realizability, addressing some of the shortcomings arising from the relatively stringent definition of realIZability.
Control Argumentation Frameworks
This work proposes Control Argumentation Frameworks (CAFs), a new approach that generalizes existing techniques, namely normal extension enforcement, by accommodating the possibility of uncertainty in dynamic scenarios.
A Dynamic Argumentation Framework
The proposed Dynamic Argumentation Framework (DAF) is a refinement of Dung's abstract framework (AF), enriched with additional features, to provide a well-structured knowledge representation tool that allows for the definition of dynamics-aware argumentation-based systems.
Merging of Abstract Argumentation Frameworks
This paper adapt model-based propositional belief merging to define extension-based merging operators for AFs and state an axiomatic and a constructive characterization of merging operators through a family of rationality postulates and a representation theorem.
Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation
This work provides a nearly complete computational complexity map of fixed-argument extension enforcement under various major AF semantics, with results ranging from polynomial-time algorithms to completeness for the second-level of thePolynomial hierarchy.