Dialogue games in defeasible logic

  • Authors:
  • S. Thakur;G. Governatori;V. Padmanabhan;J. Eriksson Lundström

  • Affiliations:
  • School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Queensland, Australia;School of Information Technology and Electrical Engineering, The University of Queensland, Brisbane, Queensland, Australia;Dept. of Computer & Information Sciences, University of Hyderabad, India;Uppsala University, Sweden

  • Venue:
  • AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show how to capture dialogue games in Defeasible Logic. We argue that Defeasible Logic is a natural candidate and general representation formalism to capture dialogue games even with requirements more complex than existing formalisms for this kind of games. We parse the dialogue into defeasible rules with time of the dialogue as time of the rule. As the dialogue evolves we allow an agent to upgrade the strength of unchallenged rules. The proof procedures of [1] are used to determine the winner of a dialogue game.