Probabilistic opponent-model search
Information Sciences: an International Journal - Heuristic Search and Computer Game Playing
The Role of Logic in Computational Models of Legal Argument: A Critical Survey
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Strategical considerations for negotiating agents
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
On the relevance of utterances in formal inter-agent dialogues
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Computational Models of Argument: Proceedings of COMMA 2008 (Frontiers in Artificial Intelligence and Applications)
Mechanism design for abstract argumentation
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Success chances in argument games: a probabilistic approach to legal disputes
Proceedings of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference
Semantics for Evidence-Based Argumentation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Heuristics in Argumentation: A Game-Theoretical Investigation
Proceedings of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008
Arguing with Confidential Information
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Incorporating opponent models into adversary search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Progressive defeat paths in abstract argumentation frameworks
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Choosing persuasive arguments for action
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Probabilistic argumentation frameworks
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
Case-based strategies for argumentation dialogues in agent societies
Information Sciences: an International Journal
Opponent modelling in persuasion dialogues
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Opponent models with uncertainty for strategic argumentation
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
While researchers have looked at many aspects of argumentation, an area often neglected is that of argumentation strategies. That is, given multiple possible arguments that an agent can put forth, which should be selected in what circumstances. In this paper we propose a heuristic that implements one such strategy. The heuristic is built around opponent modelling, and operates by selecting the line of argument that yields maximal utility, based on the opponent's expected response, as computed by the opponent model. An opponent model may be recursive, with the opponent modelling of the agent captured by the original agent's opponent model. Computing the utility for each possible line of argument is thus done using a variant of M* search, which in itself is an enhancement of min-max search. After describing the M* algorithm we show how it may be adapted to the argumentation domain, and then study what enhancements are possible for more specific types of dialogue. Finally, we discuss how this heuristic may be extended in future work, and its relevance to argumentation theory in general.