Hunter, A;
Thimm, M;
(2016)
Optimization of dialectical outcomes in dialogical argumentation.
International Journal of Approximate Reasoning
, 78
pp. 73-102.
10.1016/j.ijar.2016.06.014.
Preview |
Text
arglotteries.pdf - Accepted Version Download (341kB) | Preview |
Abstract
When informal arguments are presented, there may be imprecision in the language used, and so the audience may be uncertain as to the structure of the argument graph as intended by the presenter of the arguments. For a presenter of arguments, it is useful to know the audience’s argument graph, but the presenter may be uncertain as to the structure of it. To model the uncertainty as to the structure of the argument graph in situations such as these, we can use probabilistic argument graphs. The set of subgraphs of an argument graph is a sample space. A probability value is assigned to each subgraph such that the sum is 1, thereby re- flecting the uncertainty over which is the actual subgraph. We can then determine the probability that a particular set of arguments is included or excluded from an extension according to a particular Dung semantics. We represent and reason with extensions from a graph and from its subgraphs, using a logic of dialectical outcomes that we present. We harness this to define the notion of an argumentation lottery, which can be used by the audience to determine the expected utility of a debate, and can be used by the presenter to decide which arguments to present by choosing those that maximize expected utility. We investigate some of the options for using argumentation lotteries, and provide a computational evaluation.
Type: | Article |
---|---|
Title: | Optimization of dialectical outcomes in dialogical argumentation |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1016/j.ijar.2016.06.014 |
Publisher version: | https://doi.org/10.1016/j.ijar.2016.06.014 |
Language: | English |
Additional information: | Copyright © 2016. This manuscript version is published under a Creative Commons Attribution Non-commercial Non-derivative 4.0 International licence (CC BY-NC-ND 4.0). This licence allows you to share, copy, distribute and transmit the work for personal and non-commercial use providing author and publisher attribution is clearly stated. Further details about CC BY licences are available at http://creativecommons.org/licenses/by/4.0. |
Keywords: | Abstract argumentation, Strategic argumentation, Argumentation dialogues, Probabilistic argumentation, Utility theory |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/1502312 |
Archive Staff Only
View Item |