Class SeeAcceptabilityReasoner

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

public class SeeAcceptabilityReasoner extends AbstractAcceptabilityReasoner
Implements the SEE approach ("selective extension enumeration") to determine the set of acceptable arguments of an AF wrt. complete/preferred/stable semantics and credulous reasoning and wrt. stable semantics and skeptical reasoning , cf. [Thimm, Cerutti, Vallati; COMMA 2020]. It iteratively calls a SAT solver to discover new acceptable arguments.
Author:
Matthias Thimm
  • Constructor Details

    • SeeAcceptabilityReasoner

      public SeeAcceptabilityReasoner(SatSolver satSolver, Semantics semantics, InferenceMode inferenceMode)
      Creates a new IaqAcceptabilityReasoner.
      Parameters:
      satSolver - some SatSolver.
      semantics - either Semantics.CO, Semantics.PR, or Semantics.ST
      inferenceMode - either InferenceMode.CREDULOUS or InferenceMode.SKEPTICAL (only stable semantics)
  • Method Details

    • getAcceptableArguments

      public Collection<Argument> getAcceptableArguments(DungTheory aaf)
      Description copied from class: AbstractAcceptabilityReasoner
      Returns the set of acceptable arguments of this reasoner.
      Specified by:
      getAcceptableArguments in class AbstractAcceptabilityReasoner
      Parameters:
      aaf - some AAF
      Returns:
      the set of acceptable arguments of this reasoner.
    • isInstalled

      public boolean isInstalled()
      the solver is natively installed and is therefore always installed
      Returns:
      `true` if the solver is installed and available, `false` otherwise.