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

Packages that use AbstractDungReasoner

Package	Description
org.tweetyproject.arg.dung.reasoner
org.tweetyproject.arg.dung.reasoner.serialisable

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

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

Modifier and Type	Class	Description
class	AbstractAcceptabilityReasoner	Ancestor class for reasoners that are tailored towards computing the set {a | a is credulously/skeptically accepted wrt.
class	AbstractExtensionReasoner	Ancestor class for all extension-based reasoners.
class	AbstractSatExtensionReasoner	Uses a provided SAT solver to solve reasoning problems in AAFs.
class	EeeAcceptabilityReasoner	Implements the EEE approach ("exhaustively enumerate extensions") to determine the set of acceptable arguments of an AF, cf.
class	FudgeAcceptabilityReasoner	Implements the Fudge approach to determine the set of acceptable arguments of an AF wrt.
class	IaqAcceptabilityReasoner	Implements the IAQ approach ("iterative acceptability queries") to determine the set of acceptable arguments of an AF, cf.
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	SeeAcceptabilityReasoner	Implements the SEE approach ("selective extension enumeration") to determine the set of acceptable arguments of an AF wrt.
class	SeemAcceptabilityReasoner	Implements the SEEM approach ("selective extension enumeration with MaxSAT") to determine the set of credulously acceptable arguments of an AF wrt.
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	StratifiedLabelingReasoner	This class implements a stratified labeling reasoner.
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.

Uses of AbstractDungReasoner in org.tweetyproject.arg.dung.reasoner.serialisable

Subclasses of AbstractDungReasoner 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