On the realisability of weak argumentation semantics

DOI10.1093/LOGCOM/EXAF058MaRDI QIDQ6886738zbMATH OpenFDO

Authors Theodoros Doukas, Matthias Thimm

Publication date 10 December 2025

Published in Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/LOGCOM/EXAF058

zbMATH Keywords

abstract argumentationrealisabilityweak semantics

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Cites work

• A logical account of formal argumentation
• Characteristics of multiple viewpoints in abstract argumentation
• Comparing the expressiveness of argumentation semantics
• Expressiveness of two-valued semantics for abstract dialectical frameworks
• scientific article; zbMATH DE number 6902516 (Why is no real title available?)
• scientific article; zbMATH DE number 6934384 (Why is no real title available?)
• 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
• On the intertranslatability of argumentation semantics
• On the semantics of abstract argumentation
• Recursion in Abstract Argumentation is Hard --- On the Complexity of Semantics Based on Weak Admissibility
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• Well, to be honest, I wouldn't start from here at aII (a personal view of complexity in argumentation after 20 years)

This page was built for publication: On the realisability of weak argumentation semantics

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