Probabilistic Graded Semantics

Abstract We propose a new graded semantics for abstract argumentation frameworks that is based on the constellations approach to probabilistic argumentation. Given an abstract argumentation framework, our approach assigns uniform probability to all arguments and then ranks arguments according to the probability of acceptance wrt. some classical semantics. Albeit relying on a simple idea this approach (1) is based on the solid theoretical foundations of probability theory, and (2) complies with many rationality postulates proposed for graded semantics. We also investigate an application of our approach for inconsistency measurement in argumentation frameworks and show that the measure induced by the probabilistic graded semantics also complies with the basic rationality postulates from that area.
  • Matthias Thimm
  • Federico Cerutti (Cardiff)
  • Tjitze Rienstra
Date Sep-2018
Venue COMMA 2018: 7th International Conference on Computational Models of Argument, Warsaw, Poland, 12-14 September 2018.