Class RaCounterTransitivity

  • All Implemented Interfaces:
    Postulate<Argument>

    public class RaCounterTransitivity
    extends RankingPostulate
    The "counter-transitivity" postulate for ranking semantics as proposed in [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]: If the direct attackers of an argument b are at least as numerous and acceptable as those of an argument a, then a is at least as acceptable as b.
    Author:
    Anna Gessler
    • Constructor Detail

      • RaCounterTransitivity

        public RaCounterTransitivity()
    • Method Detail

      • getName

        public java.lang.String getName()
        Description copied from interface: Postulate
        The textual name of the postulate
        Returns:
        a string
      • isApplicable

        public boolean isApplicable​(java.util.Collection<Argument> kb)
        Description copied from interface: Postulate
        Checks whether the given kb represents a non-trivial instance for this postulate, i.e., whether assumptions of this postulates are satisfied (evaluating an approach on a non-applicable instance always succeeds).
        Specified by:
        isApplicable in interface Postulate<Argument>
        Specified by:
        isApplicable in class RankingPostulate
        Parameters:
        kb - some knowledge base
        Returns:
        true if the knowledge base is a non trivial instance of this postulate.