Uses of Class
org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner

Packages that use AbstractExtensionReasoner

Package	Description
org.tweetyproject.arg.aspic.reasoner
org.tweetyproject.arg.bipolar.analysis
org.tweetyproject.arg.bipolar.analysis.extensions
org.tweetyproject.arg.dung.examples
org.tweetyproject.arg.dung.learning
org.tweetyproject.arg.dung.principles
org.tweetyproject.arg.dung.reasoner
org.tweetyproject.arg.dung.reasoner.serialisable
org.tweetyproject.arg.rankings.reasoner
org.tweetyproject.arg.saf.reasoner

Uses of AbstractExtensionReasoner in org.tweetyproject.arg.aspic.reasoner

Constructors in org.tweetyproject.arg.aspic.reasoner with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	AbstractAspicReasoner(AbstractExtensionReasoner aafReasoner)	Creates a new instance
	DirectionalAspicReasoner(AbstractExtensionReasoner aafReasoner)	Creates a new instance
	DirectionalAspicReasoner(AbstractExtensionReasoner aafReasoner, double prob)	Creates a new instance
	ModuleBasedAspicReasoner(AbstractExtensionReasoner aafReasoner)	Creates a new instance
	RandomAspicReasoner(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

Constructors in org.tweetyproject.arg.bipolar.analysis with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	AbstractAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, AnalysisType analysisType)	The default constructor
	ApproxAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel)	Creates an ApproxAnalysis object
	ConcurrentApproxAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel)	Constructs ConcurrentApproxAnalysis with noThreads equal to availableProcessors - 1
	ConcurrentApproxAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel, int noThreads)	Constructs ConcurrentApproxAnalysis with batchSize equal to noThreads*2
	ConcurrentApproxAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, double errorLevel, int noThreads, int batchSize)	The default constructor for ConcurrentApproxAnalysis
	ConcurrentExactAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner)	Constructs ConcurrentExactAnalysis with noThreads equal to availableProcessors - 1
	ConcurrentExactAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, int noThreads)	Constructs ConcurrentExactAnalysis with given noThreads
	ExactAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner)	Creates an ExactAnalysis object

Uses of AbstractExtensionReasoner in org.tweetyproject.arg.bipolar.analysis.extensions

Constructors in org.tweetyproject.arg.bipolar.analysis.extensions with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	AbstractExtensionAnalysis(PEAFTheory peafTheory, AbstractExtensionReasoner extensionReasoner, AnalysisType analysisType)	The default constructor

Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.examples

Methods in org.tweetyproject.arg.dung.examples with parameters of type AbstractExtensionReasoner

Modifier and Type	Method	Description
static 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

Constructors in org.tweetyproject.arg.dung.learning with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	ExampleFinder(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2)	initialize with two specific reasoners
	ExtendedExampleFinder(AbstractExtensionReasoner reasoner1, AbstractExtensionReasoner reasoner2, AbstractExtensionReasoner reasoner3)	initialize with three specific reasoners

Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.principles

Methods in org.tweetyproject.arg.dung.principles with parameters of type AbstractExtensionReasoner

Modifier and Type	Method	Description
boolean	AdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean	CFReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean	ConflictFreePrinciple.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)
abstract boolean	Principle.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
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	SemiQualifiedAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean	StrongAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean	WeakReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)

Uses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner

Subclasses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner

Modifier and Type	Class	Description
class	AbstractSatExtensionReasoner	Uses a provided SAT solver to solve reasoning problems in AAFs.
class	ProboI23Reasoner	This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
class	ProboReasoner	This reasoner makes use of an external executable for solving reasoning problems in abstract argumentation.
class	QualifiedReasoner	Reasoner for qualified sigma-semantics.
class	SatCompleteReasoner	Uses a SAT solver to determine complete extensions.
class	SatStableReasoner	Uses a SAT solver to determine stable extensions.
class	SccCF2Reasoner	Reasoner for CF2 extensions using scc-recursiveness.
class	SCF2Reasoner	Reasoner for SCF2 extensions using scc-recursiveness.
class	SCOOCNaiveReasoner	reasoner for SCOOC-naive semantics.
class	SemiQualifiedReasoner	Reasoner for semi-qualified sigma-semantics.
class	SimpleAdmissibleReasoner	This reasoner for Dung theories performs inference on the admissible extensions.
class	SimpleCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleConflictFreeReasoner	This reasoner for Dung theories performs inference on the conflict-free extensions.
class	SimpleEagerReasoner	simple reasoner for eager semantics
class	SimpleGroundedReasoner	This reasoner for Dung theories performs inference on the grounded extension.
class	SimpleIdealReasoner	This reasoner for Dung theories performs inference on the ideal extension.
class	SimpleInitialReasoner	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 see: Yuming Xu and Claudette Cayrol.
class	SimpleNaiveReasoner	Reasoner for naive extensions.
class	SimplePreferredReasoner	This reasoner for Dung theories performs inference on the preferred extensions.
class	SimpleResolutionBasedReasoner	This reasoner for Dung theories performs inference on the resolution-based family of semantics.
class	SimpleSccCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleSccRecursiveReasoner	Universal scc-recursive reasoner initialize with any reasoner for a scc-recursive semantics
class	SimpleSemiStableReasoner	This reasoner calculates claim based semi stable extensions
class	SimpleStableReasoner	This reasoner for Dung theories performs inference on the stable extensions.
class	SimpleStageReasoner	This reasoner for Dung theories performs inference on the stage extensions.
class	SolidAdmissibleReasoner	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	Stage2Reasoner	Reasoner for Stage2 semantics using scc-recursiveness definition see: Dvorak, Gaggl: Incorporating Stage Semantics in the SCC-recursive Schema for Argumentation Semantics 2012
class	StronglyAdmissibleReasoner	Reasoner for strong admissibility A set of arguments E is strongly admissible iff all every argument A in E is defended by some argument B in E \ {A} i.e.
class	StronglyUndisputedReasoner	Implements the strongly undisputed semantics, as proposed in [Thimm.
class	UndisputedReasoner	Implements the undisputed semantics, as proposed in [Thimm.
class	VacuousReductReasoner	Implements a general vacuous reduct reasoner, as proposed in [Thimm.
class	WeaklyAdmissibleReasoner	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	WeaklyCompleteReasoner	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	WeaklyGroundedReasoner	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	WeaklyPreferredReasoner	Reasoner for weakly preferred semantics see: Baumann, Brewka, Ulbricht: Revisiting the foundations of abstract argumentation-semantics based on weak admissibility and weak defense.

Methods in org.tweetyproject.arg.dung.reasoner that return AbstractExtensionReasoner

Modifier and Type	Method	Description
static AbstractExtensionReasoner	AbstractExtensionReasoner.getSimpleReasonerForSemantics(Semantics semantics)	Creates a reasoner for the given semantics.

Constructors in org.tweetyproject.arg.dung.reasoner with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	EeeAcceptabilityReasoner(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode)	Creates a new EeeAcceptabilityReasoner.
	IaqAcceptabilityReasoner(AbstractExtensionReasoner reasoner, InferenceMode inferenceMode)	Creates a new IaqAcceptabilityReasoner.
	QualifiedReasoner(AbstractExtensionReasoner reasoner)	initialize reasoner with the given reasoner as base reasoner Will only produce meaningful results if the given semantics is SCC-decomposable
	SimpleResolutionBasedReasoner(AbstractExtensionReasoner semantics)
	SimpleSccRecursiveReasoner(AbstractExtensionReasoner reasoner)	initialize the scc-recursive reasoner with the given reasoner as base function
	VacuousReductReasoner(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

Subclasses of AbstractExtensionReasoner in org.tweetyproject.arg.dung.reasoner.serialisable

Modifier and Type	Class	Description
class	SerialisableExtensionReasoner	Abstract class for computing extensions via a serialised transition system to implement this class, you need to define a selection and a termination function Selection function a(UA, UC, C): selects and returns a subset of the initial sets Termination function b((AF, S)): If the given state satisfies a specific condition, its extension may be accepted by the associated serialised semantics
class	SerialisedAdmissibleReasoner	Serialised version of the admissible semantics
class	SerialisedCompleteReasoner	Serialised version of the complete semantics
class	SerialisedGroundedReasoner	Serialised version of the grounded semantics
class	SerialisedPreferredReasoner	Serialised version of the preferred semantics
class	SerialisedStableReasoner	Serialised version of the stable semantics
class	SerialisedUnchallengedReasoner	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.rankings.reasoner

Constructors in org.tweetyproject.arg.rankings.reasoner with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	SerialisableRankingReasoner(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

Constructors in org.tweetyproject.arg.saf.reasoner with parameters of type AbstractExtensionReasoner

Modifier	Constructor	Description
	OutputReasoner(AbstractExtensionReasoner reasoner)	Creates a new reasoner