Arguing Using Opponent Models

Nir Oren, Timothy J. Norman

Research output: Contribution to journalArticle

22 Citations (Scopus)
3 Downloads (Pure)

Abstract

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.

Original languageEnglish
Pages (from-to)160-174
Number of pages15
JournalLecture Notes in Computer Science
Volume6057
DOIs
Publication statusPublished - 2010

Keywords

  • argumentation
  • ARGUMENTATION

Cite this

Arguing Using Opponent Models. / Oren, Nir; Norman, Timothy J.

In: Lecture Notes in Computer Science, Vol. 6057, 2010, p. 160-174.

Research output: Contribution to journalArticle

Oren, Nir ; Norman, Timothy J. / Arguing Using Opponent Models. In: Lecture Notes in Computer Science. 2010 ; Vol. 6057. pp. 160-174.
@article{c33be38a5be64ee1b22e8190f5051103,
title = "Arguing Using Opponent Models",
abstract = "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.",
keywords = "argumentation, ARGUMENTATION",
author = "Nir Oren and Norman, {Timothy J.}",
year = "2010",
doi = "10.1007/978-3-642-12805-9",
language = "English",
volume = "6057",
pages = "160--174",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

T1 - Arguing Using Opponent Models

AU - Oren, Nir

AU - Norman, Timothy J.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - argumentation

KW - ARGUMENTATION

U2 - 10.1007/978-3-642-12805-9

DO - 10.1007/978-3-642-12805-9

M3 - Article

VL - 6057

SP - 160

EP - 174

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -