Class RaStrictCounterTransitivity

  • All Implemented Interfaces:
    Postulate<Argument>

    public class RaStrictCounterTransitivity
    extends RankingPostulate
    The "strict counter-transitivity" postulate for ranking semantics as proposed by [Amgoud, Ben-Naim. Ranking-based semantics for argumentation frameworks. 2013]: If the "counter-transitivity" postulate is satisfied and either the direct attackers of an b are strictly more numerous or acceptable than those of a, then a is strictly more acceptable than b.
    Author:
    Anna Gessler
    • Constructor Detail

      • RaStrictCounterTransitivity

        public RaStrictCounterTransitivity()
    • 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.