The semantic models discussed in Chapter 11 provide an important element of the formal computational theory of abstract argumentation. Such models offer a variety of interpretations for "collection of acceptable arguments" but are unconcerned with issues relating to their implementation. In other words, the extension-based semantics described earlier distinguish different views of what it means for a set, S, of arguments to be acceptable, but do not consider the procedures by which such a set might be identified. © 2009 Springer-Verlag US.
CITATION STYLE
Dunne, P. E., & Wooldridge, M. (2009). Complexity of abstract argumentation. In Argumentation in Artificial Intelligence (pp. 85–104). Springer US. https://doi.org/10.1007/978-0-387-98197-0_5
Mendeley helps you to discover research relevant for your work.