How complex is the strong admissibility semantics for abstract dialectical frameworks?

DOI10.3233/FAIA220153MaRDI QIDQ6937612zbMATH OpenFDO

Authors Atefeh Keshavarzi Zafarghandi, Wolfgang Dvořák, Rineke Verbrugge, Bart Verheij

Publication date 26 August 2025

zbMATH Keywords

complexityargumentationabstract dialectical frameworks

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

This page was built for publication: How complex is the strong admissibility semantics for abstract dialectical frameworks?

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