An asymmetric protocol for argumentation games in defeasible logic

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Agent interactions where the agents hold conflicting goals could be modelled as adversarial argumentation games. In many real-life situations (e.g., criminal litigation, consumer legislation), due to ethical, moral or other principles governing interaction, the burden of proof, i.e., which party is to lose if the evidence is balanced [22], is a priori fixed to one of the parties. Analogously, when resolving disputes in a heterogeneous agent-system the unequal importance of different agents for carrying out the overall system goal need to be accounted for. In this paper we present an asymmetric protocol for an adversarial argumentation game in Defeasible Logic, suggesting Defeasible Logic as a general representation formalism for argumentation games modelling agent interactions. © Springer-Verlag Berlin Heidelberg 2009.

Cite

CITATION STYLE

APA

Lundström, J. E., Governatori, G., Thakur, S., & Padmanabhan, V. (2009). An asymmetric protocol for argumentation games in defeasible logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5044 LNAI, pp. 219–231). https://doi.org/10.1007/978-3-642-01639-4_19

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free