The cf2 argumentation semantics revisited
From MaRDI portal
Publication:2863165
DOI10.1093/logcom/exs011zbMath1275.68138OpenAlexW2142128975MaRDI QIDQ2863165
Sarah A. 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
Related Items (8)
Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ On the Complexity of Probabilistic Abstract Argumentation Frameworks ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ 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 ⋮ Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey
This page was built for publication: The cf2 argumentation semantics revisited
