Package org.tweetyproject.arg.dung.principles

Class SccDecomposabilityPrinciple

java.lang.Object
org.tweetyproject.arg.dung.principles.Principle
org.tweetyproject.arg.dung.principles.SccDecomposabilityPrinciple
All Implemented Interfaces:
Postulate<Argument>
public class SccDecomposabilityPrinciple extends Principle
SCC Decomposability Principle also: SCC-Recursiveness A semantics satisfies SCC decomposability iff for all AFs we have: The extensions of F are the same as computing the extensions of each SCC individually and combining the result see: Pietro Baroni et al. “On the input/output behavior of argumentation frameworks” 2014
Author:
Lars Bengel

  • Constructor Details

    • SccDecomposabilityPrinciple

      public SccDecomposabilityPrinciple()

  • Method Details

    • getName

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

    • isApplicable

      public boolean isApplicable(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 Principle
      Parameters:
      kb - some knowledge base
      Returns:
      true if the knowledge base is a non trivial instance of this postulate.

    • isSatisfied

      public boolean isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
      Description copied from class: Principle
      *description missing*
      Specified by:
      isSatisfied in class Principle
      Parameters:
      kb - kb
      ev - ev
      Returns:
      is Satisfied