Class PropagationRankingReasoner

All Implemented Interfaces:
ModelProvider<Argument,DungTheory,LatticePartialOrder<Argument,DungTheory>>, PostulateEvaluatable<Argument>

public class PropagationRankingReasoner extends AbstractRankingReasoner<LatticePartialOrder<Argument,DungTheory>>
This class implements the argument ranking approach of [Delobelle. Ranking- based Semantics for Abstract Argumentation. Thesis, 2017]. In this approach, initial values are assigned to arguments and then propagated into the graph. The paper describes three different ways of computing a ranking out of the propagation vector.

Note: This implementation only works for acyclic argument graphs. For cyclic graphs null is returned.
Author:
Anna Gessler
  • Constructor Details

    • PropagationRankingReasoner

      public PropagationRankingReasoner(boolean useMultiset)
      Creates a new PropagationRankingReasoner with the given parameters.
      Parameters:
      useMultiset - determines whether the multiset (M) of attackers/defenders of length is used instead of the set (S)
    • PropagationRankingReasoner

      public PropagationRankingReasoner(double attackedArgumentsInfluence, boolean useMultiset, PropagationRankingReasoner.PropagationSemantics semantics)
      Creates a new PropagationRankingReasoner with the given parameters.
      Parameters:
      attackedArgumentsInfluence - the smaller this value is, the more important is the influence of the non-attacked arguments.
      useMultiset - determines whether the multiset (M) of attackers/defenders of length is used instead of the set (S)
      semantics - one of the three propagation semantics
  • Method Details