Package org.tweetyproject.commons

Interface QualitativeReasoner<B extends BeliefBase,F extends Formula>

Type Parameters:
B - The type of belief base that the reasoner can query. This is a subclass of BeliefBase.
F - The type of formulas that the reasoner can handle. This is a subclass of Formula.
All Superinterfaces:
Reasoner<Boolean,B,F>
All Known Implementing Classes:
AbstractAcceptabilityReasoner, AbstractAspicReasoner, AbstractClaimBasedReasoner, AbstractConditionalLogicReasoner, AbstractDungReasoner, AbstractExtendedExtensionReasoner, AbstractExtensionReasoner, AbstractExtensionSetAfReasoner, AbstractMlReasoner, AbstractPlReasoner, AbstractSatExtensionReasoner, AbstractSetAfReasoner, ArgumentationReasoner, ASPSolver, ClingoSolver, CompleteReasoner, CReasoner, DirectionalAspicReasoner, DLVSolver, EeeAcceptabilityReasoner, EFOLReasoner, FlatAbaReasoner, FlattenBasedExtendedExtensionReasoner, FolReasoner, FudgeAcceptabilityReasoner, GeneralAbaReasoner, IaqAcceptabilityReasoner, IdealReasoner, LiteralReasoner, MleanCoPReasoner, ModuleBasedAspicReasoner, NaiveDlReasoner, NaiveQbfReasoner, OutputReasoner, PreferredReasoner, ProboI23Reasoner, ProboReasoner, Prover9FolReasoner, QualifiedReasoner, RandomAspicReasoner, RuleBasedCReasoner, SatCompleteReasoner, SatReasoner, SatStableReasoner, SccCF2Reasoner, SCF2Reasoner, SCOOCNaiveReasoner, SeeAcceptabilityReasoner, SeemAcceptabilityReasoner, SemiQualifiedReasoner, SerialisableExtensionReasoner, SerialisedAdmissibleReasoner, SerialisedCompleteReasoner, SerialisedGroundedReasoner, SerialisedPreferredReasoner, SerialisedStableReasoner, SerialisedStronglyAdmissibleReasoner, SerialisedUnchallengedReasoner, SimpleAdmissibleReasoner, SimpleAdmissibleSetAfReasoner, SimpleAspicReasoner, SimpleClInheritedReasoner, SimpleClNaiveReasoner, SimpleClPreferredReaonser, SimpleClSemistableReasoner, SimpleClStableReasoner, SimpleClStagedReasoner, SimpleCompleteReasoner, SimpleCompleteSetAfReasoner, SimpleConflictFreeReasoner, SimpleConflictFreeSetAfReasoner, SimpleCReasoner, SimpleDefaultReasoner, SimpleEagerReasoner, SimpleEagerSetAfReasoner, SimpleExtendedAdmissibleReasoner, SimpleExtendedCompleteReasoner, SimpleExtendedConflictFreeReasoner, SimpleFolReasoner, SimpleGroundedReasoner, SimpleGroundedSetAfReasoner, SimpleIdealReasoner, SimpleIdealSetAfReasoner, SimpleInitialReasoner, SimpleMlReasoner, SimpleNaiveReasoner, SimplePlReasoner, SimplePreferredReasoner, SimplePreferredSetAfReasoner, SimpleRelationalCReasoner, SimpleResolutionBasedReasoner, SimpleSccCompleteReasoner, SimpleSccRecursiveReasoner, SimpleSemiStableReasoner, SimpleSemiStableSetAfReasoner, SimpleStableReasoner, SimpleStableSetAfReasoner, SimpleStageReasoner, SimpleStageSetAfReasoner, SolidAdmissibleReasoner, SpassFolReasoner, SPASSMlReasoner, StableReasoner, Stage2Reasoner, StratifiedLabelingReasoner, StronglyAdmissibleReasoner, StronglyUndisputedReasoner, UndisputedReasoner, VacuousReductReasoner, WeaklyAdmissibleReasoner, WeaklyCompleteReasoner, WeaklyGroundedReasoner, WeaklyPreferredReasoner, WellFoundedReasoner, ZReasoner
public interface QualitativeReasoner<B extends BeliefBase,F extends Formula> extends Reasoner<Boolean,B,F>
This interface represents a general contract for qualitative reasoners, which are objects that can query a belief base with a specific formula and return a boolean result (`TRUE` or `FALSE`) based on the reasoning process. The reasoning process is qualitative, meaning it does not involve probabilities or numerical values but focuses on logical entailment or satisfaction.
Author:
Matthias Thimm