Class SimpleStableSetAfReasoner

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

public class SimpleStableSetAfReasoner extends AbstractExtensionSetAfReasoner
This reasoner for setaf theories performs inference on the stable extensions. Computes the set of all stable extensions, i.e., all conflict-free sets that attack each other argument. For that, it uses the SimpleSccCompleteReasoner to first compute all complete extensions, and then filters out the non-stable ones.
Author:
Matthias Thimm, Sebastian Franke
  • Constructor Details

    • SimpleStableSetAfReasoner

      public SimpleStableSetAfReasoner()
  • Method Details

    • getModels

      public Collection<Extension<SetAf>> getModels(SetAf bbase)
      Description copied from interface: ModelProvider
      Returns a characterizing model of the given belief base
      Parameters:
      bbase - some belief base
      Returns:
      the (selected) models of the belief base
    • getModel

      public Extension<SetAf> getModel(SetAf bbase)
      Description copied from interface: ModelProvider
      Returns a single (dedicated) model of the given belief base. If the implemented method allows for more than one dedicated model, the selection may be non-deterministic.
      Parameters:
      bbase - some belief base
      Returns:
      a selected model of the belief base.
    • isInstalled

      public boolean isInstalled()
      Returns:
      if the solver is installed