Dialogue games in defeasible logic

dc.contributor.author	Thakur, S.
dc.contributor.author	Governatori, G.
dc.contributor.author	Padmanabhan, V.
dc.contributor.author	Lundström, J. Eriksson
dc.date.accessioned	2022-03-27T05:51:30Z
dc.date.available	2022-03-27T05:51:30Z
dc.date.issued	2007-01-01
dc.description.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. © Springer-Verlag Berlin Heidelberg 2007.
dc.identifier.citation	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). v.4830 LNAI
dc.identifier.issn	03029743
dc.identifier.uri	10.1007/978-3-540-76928-6_51
dc.identifier.uri	http://link.springer.com/10.1007/978-3-540-76928-6_51
dc.identifier.uri	https://dspace.uohyd.ac.in/handle/1/8400
dc.title	Dialogue games in defeasible logic
dc.type	Book Series. Conference Paper
dspace.entity.type

Now showing 1 - 1 of 1