Serialisable semantics for abstract argumentation

DOI10.3233/FAIA220143MaRDI QIDQ6937624zbMATH OpenFDO

Authors Lars Bengel, Matthias Thimm

Publication date 26 August 2025

zbMATH Keywords

computational complexityabstract argumentationserialisability

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

This page was built for publication: Serialisable semantics for abstract argumentation

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