The complexity of model checking for circumscriptive formulae
Information Processing Letters
Tractable reasoning via approximation
Artificial Intelligence
Safe and sound: artificial intelligence in hazardous applications
Safe and sound: artificial intelligence in hazardous applications
A logic-based theory of deductive arguments
Artificial Intelligence
Audiences in argumentation frameworks
Artificial Intelligence
Computable Models of the Law
Measures for persuasion dialogs: A preliminary investigation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
A lattice-based approach to computing warranted beliefs in skeptical argumentation frameworks
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
On the Measurement of Negotiation Dialogue Games
Proceedings of the 2009 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the Eighth SoMeT_09
Factual argumentation—a core model for assertions making
Journal on Computing and Cultural Heritage (JOCCH)
Choosing persuasive arguments for action
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Multi-criteria argument selection in persuasion dialogues
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Computing dialectical trees efficiently in possibilistic defeasible logic programming
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Presentation of arguments and counterarguments for tentative scientific knowledge
ArgMAS'05 Proceedings of the Second international conference on Argumentation in Multi-Agent Systems
ESWC'05 Proceedings of the Second European conference on The Semantic Web: research and Applications
Multi-criteria argument selection in persuasion dialogues
ArgMAS'11 Proceedings of the 8th international conference on Argumentation in Multi-Agent Systems
Measuring and analyzing agents' uncertainty in argumentation-based negotiation dialogue games
Expert Systems with Applications: An International Journal
Audience-based uncertainty in abstract argument games
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments, An example is the framework by Besnard and Hunter that is based on classical logic and in which an argument (obtained from a knowledgebase) is a pair where the first item is a minimal consistent set of formulae that proves the second item (which is a formula). In the framework, the only counter-arguments (defeaters) that need to be taken into account are canonical arguments (a form of minimal undercut). Argumem trees then provide a way of exhaustively collating arguments and counter-arguments. A problem with this set up is that some argument trees may be "too big" to have sufficient impact. In this paper, we address the need to increase the impact of argumentation by using pruned argument trees. We formalize this in terms of how arguments resonate with the intended audience of the arguments. For example, if a politician Wants to make a case for raising taxes, the arguments used would depend on what is important to the audience: Arguments based on increased taxes are needed to pay for improved healthcare would resonate better with an audience of pensioners, whereas arguments based on increased taxes are needtd to pay for improved transport infrastructure would resonate better with an audience of business executives. By analysing the resonance of arguments, we can prune argument trees to raise their impact.