Interface ModelProvider<S extends Formula, B extends BeliefBase, T extends Interpretation<B,S>>

Type Parameters:
S - the type of formulas
B - the type of belief bases
T - the type of interpretations
All Known Implementing Classes:
AbstractCAFReasoner, AbstractClaimBasedReasoner, AbstractConditionalLogicReasoner, AbstractEAFReasoner, AbstractExtendedExtensionReasoner, AbstractExtensionReasoner, AbstractExtensionSetAfReasoner, AbstractPclReasoner, AbstractRankingReasoner, AbstractSatExtensionReasoner, ASPSolver, BurdenBasedRankingReasoner, CategorizerRankingReasoner, ClingoSolver, CompleteReasoner, CounterTransitivityReasoner, CountingRankingReasoner, CReasoner, DefaultMeReasoner, DiscussionBasedRankingReasoner, DLVSolver, FlatAbaReasoner, FlattenBasedExtendedExtensionReasoner, GeneralAbaReasoner, GeneralizedMeReasoner, IdealReasoner, IssReasoner, IteratedGradedDefenseReasoner, PreferredReasoner, ProbabilisticRankingReasoner, ProboI23Reasoner, ProboReasoner, PropagationRankingReasoner, QualifiedReasoner, RpclMeReasoner, RuleBasedCReasoner, SAFRankingReasoner, SatCompleteReasoner, SatStableReasoner, SccCF2Reasoner, SCF2Reasoner, SCOOCNaiveReasoner, SemiQualifiedReasoner, SerialisableRankingReasoner, SerialisedExtensionReasoner, SimpleAdmissibleReasoner, SimpleAdmissibleSetAfReasoner, SimpleCAFAdmissibleReasoner, SimpleCAFGroundedReasoner, SimpleCAFPreferredReasoner, SimpleCAFStableReasoner, SimpleCAFWeakGroundedReasoner, SimpleClInheritedReasoner, SimpleClNaiveReasoner, SimpleClPreferredReaonser, SimpleClSemistableReasoner, SimpleClStableReasoner, SimpleClStagedReasoner, SimpleCompleteReasoner, SimpleCompleteSetAfReasoner, SimpleConflictFreeReasoner, SimpleConflictFreeSetAfReasoner, SimpleCReasoner, SimpleDefaultReasoner, SimpleEAFAdmissibleReasoner, SimpleEAFCompleteReasoner, SimpleEAFGroundedReasoner, SimpleEAFPreferredReasoner, SimpleEAFStableReasoner, SimpleEagerReasoner, SimpleEagerSetAfReasoner, SimpleExtendedAdmissibleReasoner, SimpleExtendedCompleteReasoner, SimpleExtendedConflictFreeReasoner, SimpleGroundedReasoner, SimpleGroundedSetAfReasoner, SimpleIdealReasoner, SimpleIdealSetAfReasoner, SimpleInitialReasoner, SimpleModelEnumerator, SimpleNaiveReasoner, SimplePreferredReasoner, SimplePreferredSetAfReasoner, SimpleRelationalCReasoner, SimpleResolutionBasedReasoner, SimpleSccCompleteReasoner, SimpleSccRecursiveReasoner, SimpleSemiStableReasoner, SimpleSemiStableSetAfReasoner, SimpleStableReasoner, SimpleStableSetAfReasoner, SimpleStageReasoner, SimpleStageSetAfReasoner, SolidAdmissibleReasoner, StableReasoner, Stage2Reasoner, StrategyBasedRankingReasoner, StratifiedLabelingReasoner, StronglyAdmissibleReasoner, StronglyUndisputedReasoner, TuplesRankingReasoner, UndisputedReasoner, VacuousReductReasoner, WeaklyAdmissibleReasoner, WeaklyCompleteReasoner, WeaklyGroundedReasoner, WeaklyPreferredReasoner, WellFoundedReasoner, ZReasoner
public interface ModelProvider<S extends Formula, B extends BeliefBase, T extends Interpretation<B,S>>
Instances of this interface model reasoners that determine the (selected) models for a given set of formulas.
Author:
Matthias Thimm

  • Method Summary

    Modifier and Type
    Method
    Description
    T
    getModel(B bbase)
    Returns a single (dedicated) model of the given belief base.
    Collection<T>
    getModels(B bbase)
    Returns a characterizing model of the given belief base

  • Method Details

    • getModels

      Collection<T> getModels(B bbase)
      Returns a characterizing model of the given belief base
      Parameters:
      bbase - some belief base
      Returns:
      the (selected) models of the belief base

    • getModel

      T getModel(B bbase)
      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.