Uses of Class
org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner
Package
Description
-
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.aspic.reasoner
ModifierConstructorDescriptionAbstractAspicReasoner
(AbstractExtensionReasoner aafReasoner) Creates a new instanceDirectionalAspicReasoner
(AbstractExtensionReasoner aafReasoner) Creates a new instanceDirectionalAspicReasoner
(AbstractExtensionReasoner aafReasoner, double prob) Creates a new instanceModuleBasedAspicReasoner
(AbstractExtensionReasoner aafReasoner) Creates a new instanceRandomAspicReasoner
(AbstractExtensionReasoner aafReasoner, int maxArguments, int maxDuplicates) Creates a new instance.SimpleAspicReasoner
(AbstractExtensionReasoner aafReasoner) Creates a new instance -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.bipolar.analysis
ModifierConstructorDescriptionAbstractAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, AnalysisType analysisType) The default constructorApproxAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel) Creates an ApproxAnalysis objectConcurrentApproxAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel) Constructs ConcurrentApproxAnalysis with noThreads equal to availableProcessors - 1ConcurrentApproxAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel, int noThreads) Constructs ConcurrentApproxAnalysis with batchSize equal to noThreads*2ConcurrentApproxAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel, int noThreads, int batchSize) The default constructor for ConcurrentApproxAnalysisConcurrentExactAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner) Constructs ConcurrentExactAnalysis with noThreads equal to availableProcessors - 1ConcurrentExactAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, int noThreads) Constructs ConcurrentExactAnalysis with given noThreadsExactAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner) Creates an ExactAnalysis object -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.bipolar.analysis.extensions
ModifierConstructorDescriptionAbstractExtensionAnalysis
(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, AnalysisType analysisType) The default constructor -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.examples
Modifier and TypeMethodDescriptionstatic void
VacuousReductReasonerExample.example1
(AbstractExtensionReasoner reasoner) static void
VacuousReductReasonerExample.example2
(AbstractExtensionReasoner reasoner) static void
VacuousReductReasonerExample.example3
(AbstractExtensionReasoner reasoner) -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.learning
ModifierConstructorDescriptionExampleFinder
(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2) initialize with two specific reasonersExtendedExampleFinder
(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2, AbstractExtensionReasoner reasoner3) initialize with three specific reasoners -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.principles
Modifier and TypeMethodDescriptionboolean
AdmissibilityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
AllowingAbstentionPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
CFReinstatementPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
ConflictFreePrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
DefencePrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
DirectionalityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
IMaximalityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
INRAPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
ModularizationPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
NaivetyPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
NonInterferencePrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) abstract boolean
Principle.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) Computes whether the given extension reasoner (i.e.boolean
ReductAdmissibilityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
ReinstatementPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
SccDecomposabilityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
SCOOCPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
SemiDirectionalityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
SemiQualifiedAdmissibilityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
StrongAdmissibilityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
WeakDirectionalityPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) boolean
WeakReinstatementPrinciple.isSatisfied
(Collection<Argument> kb, AbstractExtensionReasoner ev) -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner
Modifier and TypeClassDescriptionclass
Uses a provided SAT solver to solve reasoning problems in AAFs.class
This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.class
This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.class
Reasoner for qualified sigma-semantics.class
Uses a SAT solver to determine complete extensions.class
Uses a SAT solver to determine stable extensions.class
Reasoner for CF2 extensions using scc-recursiveness.class
Reasoner for SCF2 extensions using scc-recursiveness.class
reasoner for SCOOC-naive semantics.class
Reasoner for semi-qualified sigma-semantics.class
This reasoner for Dung theories performs inference on the admissible extensions.class
This reasoner for Dung theories performs inference on the complete extensions.class
This reasoner for Dung theories performs inference on the conflict-free extensions.class
simple reasoner for eager semanticsclass
This reasoner for Dung theories performs inference on the grounded extension.class
This reasoner for Dung theories performs inference on the ideal extension.class
Basic Implementation of a reasoner for initial sets A set of arguments S is considered initial iff it is non-empty and minimal among the non-empty admissible sets Ref: Yuming Xu and Claudette Cayrol.class
Reasoner for naive extensions.class
This reasoner for Dung theories performs inference on the preferred extensions.class
This reasoner for Dung theories performs inference on the resolution-based family of semantics.class
This reasoner for Dung theories performs inference on the complete extensions.class
Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semanticsclass
This reasoner calculates claim based semi stable extensionsclass
This reasoner for Dung theories performs inference on the stable extensions.class
This reasoner for Dung theories performs inference on the stage extensions.class
Reasoner for solid admissibility a set of arguments E solid-defends an argument a, iff for all attackers b of a it holds that all arguments c which attack b are in E see: Liu, X., and Chen, W.class
Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012class
Reasoner for strong admissibilityclass
Implements the strongly undisputed semantics, as proposed in [Thimm.class
Implements the undisputed semantics, as proposed in [Thimm.class
Implements a general vacuous reduct reasoner, as proposed in [Thimm.class
Reasoner for weak admissibility the reasoner reduces the number of sets we have to check by computing candidate sets instead of checking all sets.class
Reasoner for weakly complete semantics as described in: see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.class
Reasoner for weakly grounded semantics a set of arguments E is w-grounded iff it is w-complete and minimal Note: unlike the grounded extension which is unique, there can be more than one w-grounded extension see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.class
Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.Modifier and TypeMethodDescriptionstatic AbstractExtensionReasoner
AbstractExtensionReasoner.getSimpleReasonerForSemantics
(Semantics semantics) Creates a reasoner for the given semantics.ModifierConstructorDescriptionEeeAcceptabilityReasoner
(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode) Creates a new EeeAcceptabilityReasoner.IaqAcceptabilityReasoner
(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode) Creates a new IaqAcceptabilityReasoner.IncompleteReasoner
(AbstractExtensionReasoner reasoner) constructor for direct initialization of reasonerQualifiedReasoner
(AbstractExtensionReasoner reasoner) initialize reasoner with the given reasoner as base reasoner Will only produce meaningful results if the given semantics is SCC-decomposableinitialize the scc-recursive reasoner with the given reasoner as base functionVacuousReductReasoner
(AbstractExtensionReasoner baseReasoner, AbstractExtensionReasoner reductReasoner) Creates a new VacuousReductReasoner with the given base and reduct reasoners. -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner.serialisable
Modifier and TypeClassDescriptionclass
Ancestor class for serialisable AF reasonersclass
Serialised version of the admissible semanticsclass
Serialised version of the complete semanticsclass
Serialised version of the grounded semanticsclass
Serialised version of the preferred semanticsclass
Serialised version of the stable semanticsclass
This class represents a reasoner to compute the extensions of the strongly admissibleSemantics
by serialising unattacked initial sets.class
Serialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.extended.reasoner
ModifierConstructorDescriptionInitialize new reasoner for the given AF reasoner -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.rankings.reasoner
ModifierConstructorDescriptionSerialisableRankingReasoner
(AbstractExtensionReasoner initialSetReasoner) Creates a new serialisable ranking reasoner that uses the given reasoner for determining initial sets (this object should return all initial sets via getModels(). -
Uses of AbstractExtensionReasoner in org.tweetyproject.arg.saf.reasoner
ModifierConstructorDescriptionOutputReasoner
(AbstractExtensionReasoner reasoner) Creates a new reasoner -
Uses of AbstractExtensionReasoner in org.tweetyproject.web.services.dung
Modifier and TypeMethodDescriptionstatic AbstractExtensionReasoner
AbstractExtensionReasonerFactory.getReasoner
(AbstractExtensionReasonerFactory.Semantics sem) Creates a new reasoner measure of the given semantics with default settings.Modifier and TypeMethodDescriptionstatic Callee
DungReasonerCalleeFactory.getCallee
(DungReasonerCalleeFactory.Command cmd, AbstractExtensionReasoner reasoner, DungTheory bbase) Creates and returns a Callee instance based on the provided Command, AbstractExtensionReasoner, and DungTheory parameters.ModifierConstructorDescriptionDungReasonerGetModelCallee
(AbstractExtensionReasoner reasoner, DungTheory bbase) Constructs a new DungReasonerGetModelCallee with the specified reasoner and base DungTheory.DungReasonerGetModelsCallee
(AbstractExtensionReasoner reasoner, DungTheory bbase) Constructs a new DungReasonerGetModelsCallee with the specified reasoner and base DungTheory.