King's College London

Research portal

Equilibrium states in numerical argumentation networks

Research output: Contribution to journalArticle

Original languageEnglish
Pages (from-to)411-473
JournalLogica Universalis
Issue number4
Early online date25 Apr 2015
Publication statusPublished - Dec 2015

King's Authors


Given an argumentation network with initial values to the arguments, we look for algorithms which can yield extensions compatible with such initial values. We find that the best way of tackling this problem is to offer an iteration formula that takes the initial values and the attack relation and iterates a sequence of intermediate values that eventually converges leading to an extension. The properties surrounding the application of the iteration formula and its connection with other numerical and non-numerical techniques proposed by others are thoroughly investigated in this paper.

View graph of relations

© 2018 King's College London | Strand | London WC2R 2LS | England | United Kingdom | Tel +44 (0)20 7836 5454