On SCC-recursiveness in quantitative argumentation

DOI10.1007/978-981-96-7956-0_19MaRDI QIDQ6877224zbMATH OpenFDO

Authors Zongshun Wang, Yuping Shen

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-981-96-7956-0_19

zbMATH Keywords

abstract argumentationquantitative argumentationSCC-recursiveness

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• A mathematical treatment of defeasible reasoning and its implementation.
• A Principle-Based Analysis of Weakly Admissible Semantics
• A probabilistic approach to modelling uncertain logical arguments
• Argumentation in artificial intelligence
• Evaluation of argument strength in attack graphs: foundations and semantics
• From fine-grained properties to broad principles for gradual argumentation: a principled spectrum
• Fuzzy labelling semantics for quantitative argumentation
• Fuzzy sets
• On principle-based evaluation of extension-based argumentation semantics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
• On topology-related properties of abstract argumentation semantics. A correction and extension to ``Dynamics of argumentation systems: a division-based method
• Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
• SCC-recursiveness: a general schema for argumentation semantics
• Stage semantics and the SCC-recursive schema for argumentation semantics
• Using arguments for making and explaining decisions
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Weighted argumentation

This page was built for publication: On SCC-recursiveness in quantitative argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877224)