Extending modular semantics for bipolar weighted argumentation

Potyka, Nico 2019. Extending modular semantics for bipolar weighted argumentation. Presented at: AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems, Montreal, 13th-17th May 2019. Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS '19: Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems. pp. 1722-1730. 10.13140/RG.2.2.15107.14881

Full text not available from this repository.

Abstract

Weighted argumentation offers a tool for decision support and social media analysis. Arguments are evaluated by an iterative procedure that takes initial weights and attack and support relations into account. Mossakowski and Neuhaus recently unified different approaches and proved first convergence results in cyclic graphs. We build up on this work, simplify and generalize convergence results and add runtime guarantees. As it turns out, there is a tradeoff between convergence guarantees and the ability to move strength values away from the initial weights. We demonstrate that continuizing semantics can avoid divergence without this tradeoff. Semantically, we extend the framework with a Duality property that assures a symmetric impact of attack and support. We also present a Java implementation of modular semantics and explain the practical usefulness of the theoretical ideas.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Schools:	Computer Science & Informatics
ISBN:	978-1-4503-6309-9
Last Modified:	30 Jun 2023 09:45
URI:	https://orca.cardiff.ac.uk/id/eprint/160230

Actions (repository staff only)

Edit Item