Degrees of “in”, “out” and “undecided” in Argumentation Networks

Dov M. Gabbay, Odinaldo Rodrigues

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations


The traditional 3-valued semantics of an argumentation framework 〈A, R〉 identifies arguments that are “in”, “out” and “undecided”. Yet, it has long been recognised by the community that some elements can be at different degrees in each of these categories [1,2,3]. For example, Dung’s semantics can only classify some elements as “out”, but cannot reflect how much “out” they really are or if elements are “in” are they as much “in” as elements which are not attacked at all? In this paper we shall use a numerical approach to give a measure of “in”, “out” and “undecided” to the nodes of a network. We shall devise equations which allow for solutions that reflect these distinctions.

Original languageEnglish
Title of host publicationFrontiers in Artificial Intelligence and Applications
EditorsPietro Baroni, Thomas F. Gordon, Tatjana Scheffler, Manfred Stede
PublisherIOS Press BV
Number of pages8
ISBN (Electronic)9781614996859
StatePublished - 2016
Event6th International Conference on Computational Models of Argument, COMMA 2016 - Potsdam, Germany
Duration: 12 Sep 201616 Sep 2016

Publication series

NameFrontiers in Artificial Intelligence and Applications
ISSN (Print)0922-6389
ISSN (Electronic)1879-8314


Conference6th International Conference on Computational Models of Argument, COMMA 2016

Bibliographical note

Publisher Copyright:
© 2016 The authors and IOS Press.


  • Numerical argumentation
  • degrees of acceptance
  • numerical methods


Dive into the research topics of 'Degrees of “in”, “out” and “undecided” in Argumentation Networks'. Together they form a unique fingerprint.

Cite this