Dialogue Games in Defeasible Logic

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.

• Type: Conference
• Year: 2007
• Where: AUSAI
• Authors: Subhasis Thakur, Guido Governatori, Vineet Padmanabhan, Jenny Eriksson Lundström
• Keywords: Artificial Intelligence, AUSAI 2007, Defeasible Logic, Dialogue, Dialogue Game