Argumentation theoretic foundations for abstract dependence networks

  • Authors:

  • Patrice Caire;Leendert van der Torre;Serena Villata

  • Affiliations:

  • SnT and CSC, University of Luxembourg, Luxembourg;SnT and CSC, University of Luxembourg, Luxembourg;INRIA Sophia Antipolis, France

  • Venue:
  • AT'13 Proceedings of the Second international conference on Agreement Technologies
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we show how to argue about agreements based on dependence. First, we introduce a formal theory of arguing about agreements by instantiating Dung's abstract theory of argumentation with proposals for agreements represented as dependence networks. Second, we show that acceptable agreements are exchange based--satisfying the so-called do-ut-des principle--and not redundant. Third, to further decrease the number of proposals, we define a notion of minimal proposals. Roughly, all proposals can be split into a number of minimal sub-proposals such that if the proposal is acceptable, then its minimal sub-proposals are acceptable too. We show that minimal proposals satisfy the indecomposable do-ut-des property, i.e., they cannot be split into two nonempty sub-proposals with at most one shared agent.