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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Thakur, S., Governatori, G., Padmanabhan, V., & Lundström, J. E. (2007). Dialogue games in defeasible logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4830 LNAI, pp. 497–506). Springer Verlag. https://doi.org/10.1007/978-3-540-76928-6_51
Mendeley helps you to discover research relevant for your work.