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

DOI10.1613/JAIR.1.13603OpenAlexW3175616061MaRDI QIDQ5094077

Markus Ulbricht, Stefan Woltran, Wolfgang Dvořák

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)

Related Items (1)

Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility

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