Class WeaklyAdmissibleReasoner

All Implemented Interfaces:
ModelProvider<Argument,DungTheory,Extension<DungTheory>>, PostulateEvaluatable<Argument>, QualitativeReasoner<DungTheory,Argument>, Reasoner<Boolean,DungTheory,Argument>

public class WeaklyAdmissibleReasoner extends AbstractExtensionReasoner
Reasoner for weak admissibility the reasoner reduces the number of sets we have to check by computing candidate sets instead of checking all sets. a candidate set of an Extension E is a conflict-free set S, which contains at least one attacker of E and contains only arguments relevant to E and itself. An argument is considered relevant to E iff it attacks any argument in the same component as E. see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.
Author:
Lars Bengel
  • Constructor Details

    • WeaklyAdmissibleReasoner

      public WeaklyAdmissibleReasoner()
  • Method Details

    • getModels

      public Collection<Extension<DungTheory>> getModels(DungTheory bbase)
      computes all weakly admissible sets of bbase. A set S is weakly admissible iff it is conflict-free and no attacker of S is element of a weakly admissible set of the reduct of bbase wrt. S
      Parameters:
      bbase - an argumentation framework
      Returns:
      the weakly admissible sets of bbase
    • getModel

      public Extension<DungTheory> getModel(DungTheory bbase)
      returns one weakly admissible set of bbase
      Parameters:
      bbase - an argumentation framework
      Returns:
      a weakly admissible set
    • getAttackingCandidates

      public Set<Set<Argument>> getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)
      computes all conflict-free sets, which attack any argument in ext
      Parameters:
      bbase - an argumentation framework
      ext - an extension
      Returns:
      all sets which attack ext and are conflict-free
    • getConflictFreeCandidateSets

      public Set<Set<Argument>> getConflictFreeCandidateSets(DungTheory bbase, Collection<Argument> candidates)
      computes all conflict-free sets of bbase, that contain only arguments in candidates and all arguments are relevant an argument is considered relevant iff it attacks any argument in the same component as the given argument A
      Parameters:
      bbase - an argumentation framework
      candidates - a set of arguments
      Returns:
      conflict-free sets in bbase
    • getComponent

      public Set<Argument> getComponent(DungTheory bbase, Argument argument)
      finds the set of arguments S = {a | there exists an edge between a and argument}
      Parameters:
      bbase - an argumentation framework
      argument - an argument
      Returns:
      the set of arguments connected with argument
    • getConflictFreeSets

      public Set<Set<Argument>> getConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)
      computes all conflict-free sets of bbase, that contain only arguments in candidates
      Parameters:
      bbase - an argumentation framework
      candidates - a set of arguments
      Returns:
      conflict-free sets in bbase
    • getReduct

      public DungTheory getReduct(DungTheory bbase, Extension<DungTheory> ext)
      computes the reduct of bbase wrt. ext ie. removes all arguments from bbase which are either in ext or are attacked by any element of ext
      Parameters:
      bbase - an argumentation framework
      ext - an extension
      Returns:
      the reduct of bbase wrt. ext