On restricting the impact of self-attacking arguments in gradual semantics

DOI10.1007/978-3-030-89391-0_8OpenAlexW3206106791MaRDI QIDQ2695512

Vivien Beuselinck, Srdjan Vesic, Jérôme Delobelle

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-89391-0_8

zbMATH Keywords

abstract argumentationgradual semanticsself-attack

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic in computer science (03B70)

Cites Work

• Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
• Equilibrium states in numerical argumentation networks
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• A Game-Theoretic Measure of Argument Strength for Abstract Argumentation
• On the Issue of Reinstatement in Argumentation
• A Parametrized Ranking-Based Semantics for Persuasion
• A Principle-Based Analysis of Weakly Admissible Semantics
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• A logic-based theory of deductive arguments

This page was built for publication: On restricting the impact of self-attacking arguments in gradual semantics