Dialogue game tree with nondeterministic additive consolidation

  • Authors:

  • Yoshitaka Suzuki

  • Affiliations:

  • Research Center for Trustworthy e-Society, Japan Advanced Institute of Science and Technology

  • Venue:
  • CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we will show that theory-based legal argumentation can be formalized as a dialogue game tree. In [37], a variation of Olsson's additive consolidation [29] is used for the formalization, but this dialogue game was not treed, because, in each move on the dialogue, the consolidation must construct a unique coherent theory, but not several coherent theories. Therefore, we abandon the requirement that rational consolidation must be unique, and we allow the consolidation to generate plural outputs. Such an operator will be applied for a dialogue game tree with Bench-Capon and Sartor's example.