Abstract:We introduce notions of safety, liveness, and fairness, as commonly used in temporal reasoning, to quantitative (bipolar) argumentation dialogues where repeated inferences are drawn from argumentation graphs with weighted nodes. Between inferences, these graphs undergo updates. Strong and weak safety capture that arguments' (final) strengths remain above a specific threshold of justification and always reach the threshold eventually, respectively. Liveness requires that arguments' strengths fluctuate across the threshold of justification. Fairness notions assess how safe arguments are spread within a sequence of argumentation graphs. We formally show how these notions are related, and discuss some analytical challenges with respect to providing general guarantees for our properties.
| Subjects: | Multiagent Systems (cs.MA) |
| Cite as: | arXiv:2605.23578 [cs.MA] |
| (or arXiv:2605.23578v1 [cs.MA] for this version) | |
| https://doi.org/10.48550/arXiv.2605.23578 arXiv-issued DOI via DataCite (pending registration) |
From: Arunavo Ganguly [view email]
[v1]
Fri, 22 May 2026 12:46:38 UTC (61 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。