Matti Berthold
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Matti Berthold has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Anna Rapberger
Imperial College London
2 shared publications - Lydia Blümel
Artificial Intelligence Group, University of Hagen
2 shared publications - Markus Ulbricht
Universität Leipzig
2 shared publications - Anna Rapberger
TU Wien
1 shared publication - João Leite
NOVA School of Science and Technology NOVA LINCS NOVA University Lisbon Portugal
1 shared publication - Markus Ulbricht
ScaDS.AI Dresden/Leipzig, Universität Leipzig
1 shared publication
Latest Publications
- Open Access
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 137-147
On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation
In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives to the standard notion of admissibility from abstract argumentation, namely strong and weak admissibility, and introduce the respective preferred, complete and grounded semantics for general (sometimes called non-flat) ABA. To do so, we use abstract bipolar set-based argumentation frameworks (BSAFs) as formal playground since they concisely capture the relations between assumptions and are expressive enough to represent general non-flat ABA frameworks, as recently shown. While weak admissibility has been recently investigated for a restricted fragment of ABA in which assumptions cannot be derived (flat ABA), strong admissibility has not been investigated for ABA so far. We introduce strong admissibility for ABA and investigate desirable properties. We furthermore extend the recent investigations of weak admissibility in the flat ABA fragment to the non-flat case. We show that the central modularization property is maintained under classical, strong, and weak admissibility. We also show that strong and weakly admissible semantics in non-flat ABA share some of the shortcomings of standard admissible semantics and discuss ways to address these.
- 1 November 2025
- Published by International Joint Conferences on Artificial Intelligence
- Vol. 22 (1) , 137-147
Open AccessOn Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation
In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives to the standard notion of admissibility from abstract argumentation, namely strong and weak admissibility, and introduce the respective preferred, complete and grounded semantics for general (sometimes called non-flat) ABA. To do so, we use abstract bipolar set-based argumentation frameworks (BSAFs) as formal playground since they concisely capture the relations between assumptions and are expressive enough to represent general non-flat ABA frameworks, as recently shown. While weak admissibility has been recently investigated for a restricted fragment of ABA in which assumptions cannot be derived (flat ABA), strong admissibility has not been investigated for ABA so far. We introduce strong admissibility for ABA and investigate desirable properties. We furthermore extend the recent investigations of weak admissibility in the flat ABA fragment to the non-flat case. We show that the central modularization property is maintained under classical, strong, and weak admissibility. We also show that strong and weakly admissible semantics in non-flat ABA share some of the shortcomings of standard admissible semantics and discuss ways to address these.
- Open Access
On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation
In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives to the standard notion of admissibility from abstract argumentation, namely strong and weak admissibility, and introduce the respective preferred, complete and grounded semantics for general (sometimes called non-flat) ABA. To do so, we use abstract bipolar set-based argumentation frameworks (BSAFs) as formal playground since they concisely capture the relations between assumptions and are expressive enough to represent general non-flat ABA frameworks, as recently shown. While weak admissibility has been recently investigated for a restricted fragment of ABA in which assumptions cannot be derived (flat ABA), strong admissibility has not been investigated for ABA so far. We introduce strong admissibility for ABA and investigate desirable properties. We furthermore extend the recent investigations of weak admissibility in the flat ABA fragment to the non-flat case. We show that the central modularization property is maintained under classical, strong, and weak admissibility. We also show that strong and weakly admissible semantics in non-flat ABA share some of the shortcomings of standard admissible semantics and discuss ways to address these.
Open AccessOn Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation
In this work, we broaden the investigation of admissibility notions in the context of assumption-based argumentation (ABA). More specifically, we study two prominent alternatives to the standard notion of admissibility from abstract argumentation, namely strong and weak admissibility, and introduce the respective preferred, complete and grounded semantics for general (sometimes called non-flat) ABA. To do so, we use abstract bipolar set-based argumentation frameworks (BSAFs) as formal playground since they concisely capture the relations between assumptions and are expressive enough to represent general non-flat ABA frameworks, as recently shown. While weak admissibility has been recently investigated for a restricted fragment of ABA in which assumptions cannot be derived (flat ABA), strong admissibility has not been investigated for ABA so far. We introduce strong admissibility for ABA and investigate desirable properties. We furthermore extend the recent investigations of weak admissibility in the flat ABA fragment to the non-flat case. We show that the central modularization property is maintained under classical, strong, and weak admissibility. We also show that strong and weakly admissible semantics in non-flat ABA share some of the shortcomings of standard admissible semantics and discuss ways to address these.
- Open Access
- 9 October 2024
- Published by Springer Nature
- p. C1
Correction to: On Forgetting in Assumption-Based Argumentation
- 9 October 2024
- Published by Springer Nature
- p. C1
Open AccessCorrection to: On Forgetting in Assumption-Based Argumentation
- 9 October 2024
- Published by Springer Nature
- p. 235-248
On Forgetting in Assumption-Based Argumentation
- 24 September 2023
- Published by Springer Nature
- p. 145-160
On the Expressive Power of Assumption-Based Argumentation
- 24 September 2023
- Published by Springer Nature
- p. 145-160
On the Expressive Power of Assumption-Based Argumentation
- Open Access
- 20 September 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (5-6) , 1038-1055
A Syntactic Operator for Forgetting that Satisfies Strong Persistence
Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence – a property that seems to best capture the essence of forgetting in the context of ASP – whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program.
- 20 September 2019
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (5-6) , 1038-1055
Open AccessA Syntactic Operator for Forgetting that Satisfies Strong Persistence
Whereas the operation of forgetting has recently seen a considerable amount of attention in the context of Answer Set Programming (ASP), most of it has focused on theoretical aspects, leaving the practical issues largely untouched. Recent studies include results about what sets of properties operators should satisfy, as well as the abstract characterization of several operators and their theoretical limits. However, no concrete operators have been investigated.In this paper, we address this issue by presenting the first concrete operator that satisfies strong persistence – a property that seems to best capture the essence of forgetting in the context of ASP – whenever this is possible, and many other important properties. The operator is syntactic, limiting the computation of the forgetting result to manipulating the rules in which the atoms to be forgotten occur, naturally yielding a forgetting result that is close to the original program.