Equilibrium states in numerical argumentation networks

From MaRDI portal
Publication:895825

DOI10.1007/S11787-015-0119-7zbMATH Open1346.68185arXiv1408.6706OpenAlexW2075002200MaRDI QIDQ895825FDOQ895825


Authors: Dov Gabbay, Odinaldo Rodrigues Edit this on Wikidata


Publication date: 7 December 2015

Published in: Logica Universalis (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1408.6706




Recommendations




Cites Work


Cited In (9)





This page was built for publication: Equilibrium states in numerical argumentation networks

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