Class DiscussionBasedRankingReasoner

  • All Implemented Interfaces:
    net.sf.tweety.commons.ModelProvider<net.sf.tweety.arg.dung.syntax.Argument,​net.sf.tweety.arg.dung.syntax.DungTheory,​LatticeArgumentRanking>, net.sf.tweety.commons.postulates.PostulateEvaluatable<net.sf.tweety.arg.dung.syntax.Argument>

    public class DiscussionBasedRankingReasoner
    extends AbstractRankingReasoner<LatticeArgumentRanking>
    This class implements the "Discussion-based" argument semantics approach as proposed by [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]. It compares arguments by counting the number of paths ending to to them. If some arguments are equivalent wrt. to their number of direct attackers, the size of paths is increased recursively until a difference is found.
    Author:
    Anna Gessler
    • Constructor Detail

      • DiscussionBasedRankingReasoner

        public DiscussionBasedRankingReasoner()
    • Method Detail

      • getNumberOfPathsOfLength

        public int getNumberOfPathsOfLength​(net.sf.tweety.arg.dung.syntax.DungTheory base,
                                            net.sf.tweety.arg.dung.syntax.Argument a,
                                            int i)
        Returns the number of linear discussions of the given length in the given DungTheory for the given argument.
        Parameters:
        base - the abstract argumentation framework
        a - an argument
        i - length of linear discussions
        Returns:
        the number of linear discussions of the given length