Weak argumentation semantics and unsafe odd cycles: results and a conjecture

DOI10.1007/978-3-031-43619-2_12MaRDI QIDQ6545529zbMATH OpenFDO

Authors Sjur Dyrkolbotn

Publication date 29 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43619-2_12

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Recommendations

• Solving semantic problems with odd-length cycles in argumentation
• Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack
• New weak admissibility semantics for abstract argumentation
• The cf2 argumentation semantics revisited
• Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility

Cites work

• A comprehensive account of the burden of persuasion in abstract argumentation
• A Principle-Based Analysis of Weakly Admissible Semantics
• Initial sets in abstract argumentation frameworks
• On kernels and semikernels of digraphs
• 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
• Propositional discourse logic
• SCC-recursiveness: a general schema for argumentation semantics
• Semi-stable semantics
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• Solutions of irreflexive relations

Cited in

(2)

• New weak admissibility semantics for abstract argumentation
• Defining defense and defeat in abstract argumentation from scratch -- A generalizing approach

This page was built for publication: Weak argumentation semantics and unsafe odd cycles: results and a conjecture

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