Dialogue games in defeasible logic
2007 (English)In: AI 2007: Advances in Artificial Intelligence: 20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Australia, December 2-6, 2007. Proceedings / [ed] Mehmet A. Orgun, John Thornton, Berlin / Heidelberg: Springer Berlin/Heidelberg, 2007, 497-506 p.Conference paper (Refereed)
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  are used to determine the winner of a dialogue game.
Place, publisher, year, edition, pages
Berlin / Heidelberg: Springer Berlin/Heidelberg, 2007. 497-506 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 4830
Computer and Information Science
IdentifiersURN: urn:nbn:se:uu:diva-12952DOI: 10.1007/978-3-540-76928-6ISBN: 978-3-540-76926-2OAI: oai:DiVA.org:uu-12952DiVA: diva2:40722
20th Australian Joint Conference on Artificial Intelligence, Gold Coast, Australia, December 2-6, 2007