Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility

DOI10.1613/JAIR.1.13603MaRDI QIDQ5094077zbMATH OpenOpenAlexFDO

Authors Wolfgang Dvořák, Markus Ulbricht, Stefan Woltran

Publication date 2 August 2022

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.13603

zbMATH Keywords

computational complexityknowledge representationabstract argumentation frameworks

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Recommendations

• On the computational complexity of assumption-based argumentation for default reasoning.
• Computing strongly admissible sets
• The computational complexity of ideal semantics
• Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
• New weak admissibility semantics for abstract argumentation

Cited in

(3)

• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• Weak argumentation semantics and unsafe odd cycles: results and a conjecture
• New weak admissibility semantics for abstract argumentation

This page was built for publication: Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility

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