The \(cf2\) argumentation semantics revisited

DOI10.1093/LOGCOM/EXS011zbMATH Open1275.68138OpenAlexW2142128975MaRDI QIDQ2863165

Sarah Alice Gaggl, Stefan Woltran

Publication date: 21 November 2013

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

Full work available at URL: https://doi.org/10.1093/logcom/exs011

zbMATH Keywords

complexitysuccinctnessabstract argumentationstrong equivalence\(cf2\) semantics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cited In (9)

• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets
• On efficiently estimating the probability of extensions in abstract argumentation frameworks
• On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
• Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility
• The Jiminy advisor: moral agreements among stakeholders based on norms and argumentation
• Paracoherent Answer Set Semantics meets Argumentation Frameworks
• On the Complexity of Probabilistic Abstract Argumentation Frameworks
• Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for publication: The \(cf2\) argumentation semantics revisited

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