Uses of Class
net.sf.tweety.arg.dung.reasoner.AbstractExtensionReasoner

Packages that use AbstractExtensionReasoner

Package	Description
net.sf.tweety.arg.dung.reasoner

Uses of AbstractExtensionReasoner in net.sf.tweety.arg.dung.reasoner

Subclasses of AbstractExtensionReasoner in net.sf.tweety.arg.dung.reasoner

Modifier and Type	Class	Description
class	AbstractSatExtensionReasoner	Uses a provided SAT solver to solve reasoning problems in AAFs.
class	NaiveReasoner	Reasoner for naive extensions.
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	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	SimplePreferredReasoner	This reasoner for Dung theories performs inference on the preferred extensions.
class	SimpleSccCompleteReasoner	This reasoner for Dung theories performs inference on the complete extensions.
class	SimpleSemiStableReasoner	This reasoner for Dung theories performs inference on the 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	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	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.

Methods in net.sf.tweety.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 net.sf.tweety.arg.dung.reasoner with parameters of type AbstractExtensionReasoner

Constructor	Description
EeeAcceptabilityReasoner(AbstractExtensionReasoner reasoner, net.sf.tweety.commons.InferenceMode inferenceMode)	Creates a new EeeAcceptabilityReasoner.
IaqAcceptabilityReasoner(AbstractExtensionReasoner reasoner, net.sf.tweety.commons.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