Package org.tweetyproject.arg.setaf.reasoners

Class SimplePreferredSetAfReasoner

java.lang.Object
org.tweetyproject.arg.setaf.reasoners.AbstractSetAfReasoner
org.tweetyproject.arg.setaf.reasoners.AbstractExtensionSetAfReasoner
org.tweetyproject.arg.setaf.reasoners.SimplePreferredSetAfReasoner
All Implemented Interfaces:
ModelProvider<Argument,SetAf,Extension<SetAf>>, PostulateEvaluatable<Argument>, QualitativeReasoner<SetAf,Argument>, Reasoner<Boolean,SetAf,Argument>
public class SimplePreferredSetAfReasoner extends AbstractExtensionSetAfReasoner
This reasoner for setaf theories performs inference on the preferred extensions. Computes the set of all preferred extensions, i.e., all maximal admissible sets. It does so by first computing all complete extensions and then check for set maximality.
Author:
Matthias Thimm, Sebastian Franke

  • Constructor Details

    • SimplePreferredSetAfReasoner

      public SimplePreferredSetAfReasoner()

  • 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