Uses of Interface
org.tweetyproject.arg.dung.reasoner.KOptimisationReasoner

Packages that use KOptimisationReasoner

Package	Description
org.tweetyproject.arg.dung.reasoner

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

Classes in org.tweetyproject.arg.dung.reasoner that implement KOptimisationReasoner

Modifier and Type	Class	Description
class	GCF_GreedyKApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-stable extension by iteratively adding arguments (without introducing conflicts) that add the maximal number of arguments to the range.
class	GFR_GreedyKApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-stable* extension by iteratively adding arguments that add the maximal number of arguments to the range, until full range is achieved.
class	GgAdmissibleApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-admissible# extension by iteratively adding arguments that add the maximal number of defended attacks.
class	GgAdmissibleAstApproximationReasoner	Starting from the empty set, this algorithms greedily determines an approximation to a k-admissible* extension by iteratively adding arguments that violate the least number of attacks.
class	GsAdmissibleApproximationReasoner	Starting from the set of all arguments, this algorithms greedily determines an approximation to a k-admissible# extension by iteratively removing arguments that add the maximal number of satisfied attacks.
class	GsAdmissibleAstApproximationReasoner	Starting from the set of all arguments, this algorithms greedily determines an approximation to a k-admissible* extension by iteratively removing arguments that add the maximal number of satisfied attacks.
class	MaxSatKAdmissibleAstReasoner	A MaxSAT-based implementation for solving the MaxAdm* problem from [Skiba,Thimm; 2024]
class	MaxSatKAdmissibleReasoner	A MaxSAT-based implementation for solving the MaxAdm# problem from [Skiba,Thimm; 2024]
class	MaxSatKStableAstReasoner	A MaxSAT-based implementation for solving the MaxStable* problem from [Thimm.
class	MaxSatKStableReasoner	A MaxSAT-based implementation for solving the MaxStable problem from [Thimm.
class	SCF_GreedyKApproximationReasoner	Starting from the complete set of arguments, this algorithms greedily determines an approximation to a k-stable extension by iteratively removing arguments (that resolve a maximal number of conflicts) until the set is conflict-free.
class	SFR_GreedyKApproximationReasoner	Starting from the complete set of arguments, this algorithms greedily determines an approximation to a k-stable* extension by iteratively removing arguments (without losing full range) that remove the maximal number of conflicts.