Uses of Class
org.tweetyproject.arg.dung.syntax.DungTheory

Packages that use DungTheory

Package	Description
org.tweetyproject.agents.dialogues
org.tweetyproject.agents.dialogues.lotteries
org.tweetyproject.agents.dialogues.oppmodels
org.tweetyproject.agents.dialogues.structured
org.tweetyproject.arg.aba.syntax
org.tweetyproject.arg.aspic.reasoner
org.tweetyproject.arg.aspic.syntax
org.tweetyproject.arg.bipolar.io.eaf
org.tweetyproject.arg.bipolar.syntax
org.tweetyproject.arg.caf.syntax
org.tweetyproject.arg.caf.util
org.tweetyproject.arg.deductive.syntax
org.tweetyproject.arg.delp.syntax
org.tweetyproject.arg.dung.analysis
org.tweetyproject.arg.dung.causal.syntax
org.tweetyproject.arg.dung.divisions
org.tweetyproject.arg.dung.equivalence
org.tweetyproject.arg.dung.equivalence.kernel
org.tweetyproject.arg.dung.examples
org.tweetyproject.arg.dung.independence
org.tweetyproject.arg.dung.ldo.semantics
org.tweetyproject.arg.dung.ldo.syntax
org.tweetyproject.arg.dung.learning
org.tweetyproject.arg.dung.learning.syntax
org.tweetyproject.arg.dung.parser
org.tweetyproject.arg.dung.principles
org.tweetyproject.arg.dung.reasoner
org.tweetyproject.arg.dung.semantics
org.tweetyproject.arg.dung.serialisability.semantics
org.tweetyproject.arg.dung.serialisability.syntax
org.tweetyproject.arg.dung.serialisability.util
org.tweetyproject.arg.dung.syntax
org.tweetyproject.arg.dung.util
org.tweetyproject.arg.dung.writer
org.tweetyproject.arg.extended.syntax
org.tweetyproject.arg.prob.analysis
org.tweetyproject.arg.prob.dynamics
org.tweetyproject.arg.prob.lotteries
org.tweetyproject.arg.prob.semantics
org.tweetyproject.arg.prob.syntax
org.tweetyproject.arg.rankings.postulates
org.tweetyproject.arg.rankings.reasoner
org.tweetyproject.arg.rankings.util
org.tweetyproject.arg.saf.syntax
org.tweetyproject.arg.social.syntax
org.tweetyproject.arg.weighted.reasoner
org.tweetyproject.arg.weighted.syntax
org.tweetyproject.web.services
org.tweetyproject.web.services.dung

Uses of DungTheory in org.tweetyproject.agents.dialogues

Subclasses of DungTheory in org.tweetyproject.agents.dialogues

Modifier and Type	Class	Description
class	ExecutableDungTheory	This class packs a Dung theory into an executable object.

Methods in org.tweetyproject.agents.dialogues that return DungTheory

Modifier and Type	Method	Description
DungTheory	ArgumentationEnvironment.getPerceivedDungTheory(Extension<DungTheory> arguments)	Returns the view of the universal Dung theory restricted to the given set of arguments.
DungTheory	LotteryArgumentationEnvironment.getPerceivedDungTheory(Extension<?> arguments)	Returns the view of the universal Dung theory restricted to the given set of arguments.

Methods in org.tweetyproject.agents.dialogues that return types with arguments of type DungTheory

Modifier and Type	Method	Description
DialogueTrace<Argument,Extension<DungTheory>>	ArgumentationEnvironment.getDialogueTrace()	Returns the current dialogue trace.
DialogueTrace<DungTheory,Collection<DungTheory>>	LotteryArgumentationEnvironment.getDialogueTrace()	Returns the current dialogue trace.
DialogueTrace<DungTheory,Collection<DungTheory>>	LotteryArgumentationEnvironment.getDialogueTrace()	Returns the current dialogue trace.

Method parameters in org.tweetyproject.agents.dialogues with type arguments of type DungTheory

Modifier and Type	Method	Description
DungTheory	ArgumentationEnvironment.getPerceivedDungTheory(Extension<DungTheory> arguments)	Returns the view of the universal Dung theory restricted to the given set of arguments.

Constructors in org.tweetyproject.agents.dialogues with parameters of type DungTheory

Modifier	Constructor	Description
	ArgumentationEnvironment(DungTheory universalTheory)	Creates a new grounded environment.
	ExecutableDungTheory(DungTheory theory)	Creates a new dung theory for the given Dung theory.
	LotteryArgumentationEnvironment(DungTheory universalTheory)	Creates a new grounded environment.

Uses of DungTheory in org.tweetyproject.agents.dialogues.lotteries

Methods in org.tweetyproject.agents.dialogues.lotteries that return DungTheory

Modifier and Type	Method	Description
DungTheory	AbstractLotteryAgent.getTheory()	Returns the theory of this agent.
DungTheory	ProbabilisticLotteryAgent.getTheory()	Returns the theory of this agent.

Methods in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheory

Modifier and Type	Method	Description
abstract double	AbstractLotteryAgent.getUtility(DungTheory theory, Semantics semantics)	Returns the utility of the agent wrt.
double	DummyLotteryAgent.getUtility(DungTheory theory, Semantics semantics)
double	ProbabilisticLotteryAgent.getUtility(DungTheory theory, Semantics semantics)
double	RandomLotteryAgent.getUtility(DungTheory theory, Semantics semantics)
double	UtilityBasedLotteryAgent.getUtility(DungTheory theory, Semantics semantics)	Returns the utility of a given Dung theory based on the agent's utility function and the specified semantics.

Constructors in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheory

Modifier	Constructor	Description
	AbstractLotteryAgent(String name, DungTheory theory, Semantics semantics)	Creates a new lottery agent
	DummyLotteryAgent(String name, DungTheory theory, Semantics semantics)	Create DummyLotteryAgent
	LotteryGameSystem(DungTheory universalTheory)	Creates a new grounded game system.
	ProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics)	Creates a new lottery agent
	ProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy)	Creates a new lottery agent
	ProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy, double stickynesscoefficient)	Creates a new lottery agent
	RandomLotteryAgent(String name, DungTheory theory, UtilityFunction util, Semantics semantics)	Creates a new agent with the given name, theory, utility function and semantics
	UtilityBasedLotteryAgent(String name, DungTheory theory, UtilityFunction util, Semantics semantics)	Constructs a new UtilityBasedLotteryAgent with the given name, Dung theory, utility function, and semantics.

Uses of DungTheory in org.tweetyproject.agents.dialogues.oppmodels

Subclasses with type arguments of type DungTheory in org.tweetyproject.agents.dialogues.oppmodels

Modifier and Type	Class	Description
class	GroundedGameUtilityFunction	The grounded game utility function u_a^g.

Method parameters in org.tweetyproject.agents.dialogues.oppmodels with type arguments of type DungTheory

Modifier and Type	Method	Description
Pair<Double,Set<ExecutableExtension>>	T1BeliefState.doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension<DungTheory>> trace)
double	GroundedGameUtilityFunction.getUtility(DialogueTrace<Argument,Extension<DungTheory>> trace)
double	GroundedGameUtilityFunction.getUtility(DialogueTrace<Argument,Extension<DungTheory>> trace, Set<Argument> additionalArguments, Set<Attack> additionalAttacks)
abstract void	BeliefState.update(DialogueTrace<Argument,Extension<DungTheory>> trace)	Updates the current belief state accordingly to the given dialogue trace.
void	T1BeliefState.update(DialogueTrace<Argument,Extension<DungTheory>> trace)
void	T2BeliefState.update(DialogueTrace<Argument,Extension<DungTheory>> trace)
void	T3BeliefState.update(DialogueTrace<Argument,Extension<DungTheory>> trace)

Constructors in org.tweetyproject.agents.dialogues.oppmodels with parameters of type DungTheory

Modifier	Constructor	Description
	GroundedGameSystem(DungTheory universalTheory)	Creates a new grounded game system.
	GroundedGameUtilityFunction(DungTheory theory, Argument argument, GroundedGameSystem.AgentFaction faction)	Construct utility function.

Constructor parameters in org.tweetyproject.agents.dialogues.oppmodels with type arguments of type DungTheory

Modifier	Constructor	Description
	BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new belief-state with the given parameters.
	BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new belief-state with the given parameters.
	T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new T1-belief-state with the given parameters and without nesting.
	T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new T1-belief-state with the given parameters and without nesting.
	T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, T1BeliefState oppModel)	Creates a new T1-belief-state with the given parameters.
	T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, T1BeliefState oppModel)	Creates a new T1-belief-state with the given parameters.
	T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new T2-belief-state with the given parameters and without nesting.
	T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction)	Creates a new T2-belief-state with the given parameters and without nesting.
	T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, ProbabilityFunction<T2BeliefState> prob)	Creates a new T2-belief-state with the given parameters.
	T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, ProbabilityFunction<T2BeliefState> prob)	Creates a new T2-belief-state with the given parameters.
	T3BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, Set<Argument> virtualArguments, Set<Attack> virtualAttacks, RecognitionFunction rec, ProbabilityFunction<T3BeliefState> prob)	Creates a new T3-belief-state with the given parameters.
	T3BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument,Extension<DungTheory>> utilityFunction, Set<Argument> virtualArguments, Set<Attack> virtualAttacks, RecognitionFunction rec, ProbabilityFunction<T3BeliefState> prob)	Creates a new T3-belief-state with the given parameters.

Uses of DungTheory in org.tweetyproject.agents.dialogues.structured

Subclasses of DungTheory in org.tweetyproject.agents.dialogues.structured

Modifier and Type	Class	Description
class	PerceivableStructuredArgumentationFramework	This class packs a structured argumentation framework into a perceivable object.

Uses of DungTheory in org.tweetyproject.arg.aba.syntax

Methods in org.tweetyproject.arg.aba.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	AbaTheory.asDungTheory()	Return a Dung Theory derived from this ABA theory

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

Methods in org.tweetyproject.arg.aspic.reasoner that return DungTheory

Modifier and Type	Method	Description
DungTheory	DirectionalAspicReasoner.asRestrictedDungTheory(AspicArgumentationTheory<T> aat, boolean simplifyArgumentStructure, T conc)	Generate restricted AF based on given theory and conclusion.
abstract DungTheory	AbstractAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query)	Computes the Dung theory from which the answer will be derived
DungTheory	DirectionalAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory	ModuleBasedAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory	RandomAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory	SimpleAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query)

Methods in org.tweetyproject.arg.aspic.reasoner with parameters of type DungTheory

Modifier and Type	Method	Description
final Boolean	AbstractAspicReasoner.query(DungTheory dt, T query, InferenceMode inferenceMode)

Uses of DungTheory in org.tweetyproject.arg.aspic.syntax

Methods in org.tweetyproject.arg.aspic.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	AspicArgumentationTheory.asDungTheory()	This method transfers this Aspic+ theory into a Dung style argumentation system
DungTheory	AspicArgumentationTheory.asDungTheory(boolean simplifyArgumentStructure)	This method transfers this Aspic+ theory into a Dung style argumentation system

Uses of DungTheory in org.tweetyproject.arg.bipolar.io.eaf

Methods in org.tweetyproject.arg.bipolar.io.eaf that return DungTheory

Modifier and Type	Method	Description
static DungTheory	EAFToDAFConverter.convert(EAFTheory eafTheory)	Return a dungtheory version of the input

Uses of DungTheory in org.tweetyproject.arg.bipolar.syntax

Methods in org.tweetyproject.arg.bipolar.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	EAFTheory.convertToDAFNaively()	This method converts this EAF to a DAF with using Algorithm 1 from Oren et.
DungTheory	DeductiveArgumentationFramework.getCompleteAssociatedDungTheory()	constructs the complete associated dung theory of this bipolar argumentation framework i.e.
DungTheory	DeductiveArgumentationFramework.getMetaFramework()	constructs the meta dung theory of this bipolar argumentation framework by adding meta-arguments for every attack and support relation See Boella et al.

Constructor parameters in org.tweetyproject.arg.bipolar.syntax with type arguments of type DungTheory

Modifier	Constructor	Description
	ArgumentSet(Extension<DungTheory> ext)	Constructs an ArgumentSet and initializes it with the arguments from a given Extension<DungTheory>.

Uses of DungTheory in org.tweetyproject.arg.caf.syntax

Subclasses of DungTheory in org.tweetyproject.arg.caf.syntax

Modifier and Type	Class	Description
class	ConstrainedArgumentationFramework	This class implements a constrained abstract argumentation theory (CAF) using a propositional logic formula.

Uses of DungTheory in org.tweetyproject.arg.caf.util

Methods in org.tweetyproject.arg.caf.util with parameters of type DungTheory

Modifier and Type	Method	Description
ArrayList<ConstrainedArgumentationFramework>	CafTheoryGenerator.next(DungTheory theory, int numCAFs)	Generates numCAFs CAFs, each with a different randomly generated constraint.

Uses of DungTheory in org.tweetyproject.arg.deductive.syntax

Methods in org.tweetyproject.arg.deductive.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	SimplePlLogicDeductiveKnowledgebase.getAF()	Builds the argumentation framework (AF) by generating arguments and attacks between them based on the knowledge base.

Uses of DungTheory in org.tweetyproject.arg.delp.syntax

Methods in org.tweetyproject.arg.delp.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	DefeasibleLogicProgram.getDungTheory()	This method translates this delp into an abstract Dung theory.

Uses of DungTheory in org.tweetyproject.arg.dung.analysis

Classes in org.tweetyproject.arg.dung.analysis with type parameters of type DungTheory

Modifier and Type	Class	Description
class	CycleCountInconsistencyMeasure<T extends DungTheory>	This class represents an inconsistency measure based on the count of cycles in an argumentation framework.
class	DrasticInconsistencyMeasure<T extends DungTheory>	Calculates the drastic inconsistency measure of the given argumentation framework.It implements the InconsistencyMeasure interface.
interface	InconsistencyMeasure<T extends DungTheory>	This interface represents a measure of inconsistency for a Dungian argumentation framework.
class	InSumInconsistencyMeasure<T extends DungTheory>	This class implements an inconsistency measure for Dung's argumentation frameworks based on the number of attacks within the framework.
class	NonGroundedCountInconsistencyMeasure<T extends DungTheory>	Calculates the non-grounded count inconsistency measure of the given argumentation framework.
class	PreferredCountInconsistencyMeasure<T extends DungTheory>	This class represents an inconsistency measure based on the count of preferred extensions in a Dung theory.
class	UnstableCountInconsistencyMeasure<T extends DungTheory>	This class represents an inconsistency measure based on stable extensions.
class	WeightedComponentCountInconsistencyMeasure<T extends DungTheory>	Implements an inconsistency measure for Dung's argumentation frameworks based on the weighted count of connected components within the framework.
class	WeightedCycleCountInconsistencyMeasure<T extends DungTheory>	This class provides an inconsistency measure for Dung's argumentation frameworks based on the count and structure of cycles within the framework.
class	WeightedInSumInconsistencyMeasure<T extends DungTheory>	Implements an inconsistency measure for Dung's argumentation frameworks based on the weighted sum of incoming attacks to each argument.
class	WeightedOutSumInconsistencyMeasure<T extends DungTheory>	This class implements an inconsistency measure for Dung's argumentation frameworks based on the weighted sum of outgoing attacks from each argument.

Uses of DungTheory in org.tweetyproject.arg.dung.causal.syntax

Subclasses of DungTheory in org.tweetyproject.arg.dung.causal.syntax

Modifier and Type	Class	Description
class	InducedTheory	This class describes an abstract argumentation framework that was induced by a CausalKnowledgeBase Reference "Argumentation-based Causal and Counterfactual Reasoning" by Lars Bengel, Lydia Blümel, Tjitze Rienstra and Matthias Thimm, published at 1st International Workshop on Argumentation for eXplainable AI (ArgXAI, co-located with COMMA ’22), September 12, 2022

Uses of DungTheory in org.tweetyproject.arg.dung.divisions

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.dung.divisions

Modifier and Type	Class	Description
class	Division	A pair <P,V> is a division of AAF G w.r.t.
class	Division	A pair <P,V> is a division of AAF G w.r.t.

Methods in org.tweetyproject.arg.dung.divisions that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	Division.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this division, i.e.

Methods in org.tweetyproject.arg.dung.divisions with parameters of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	Division.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this division, i.e.
static Collection<Division>	Division.getDivisions(Collection<Extension<DungTheory>> exts, DungTheory aaf)	Returns all divisions of all given extensions and the given aaf.
static Collection<Division>	Division.getDivisions(Extension<DungTheory> ext, DungTheory aaf)	Returns all divisions of aaf that arise from the given extension.
static Collection<Division>	Division.getStandardDivisions(DungTheory theory)	Returns the standard set of divisions of the given argumentation theory, i.e.
static boolean	Division.isDisjoint(Collection<Division> divisions, DungTheory theory, Semantics semantics)	Checks whether the given set o divisions is disjoint wrt.
static boolean	Division.isExhaustive(Collection<Division> divisions, DungTheory theory, Semantics semantics)	Checks whether the given set of divisions is exhaustive wrt.

Method parameters in org.tweetyproject.arg.dung.divisions with type arguments of type DungTheory

Modifier and Type	Method	Description
static Collection<Division>	Division.getDivisions(Collection<Extension<DungTheory>> exts, DungTheory aaf)	Returns all divisions of all given extensions and the given aaf.
static Collection<Division>	Division.getDivisions(Extension<DungTheory> ext, DungTheory aaf)	Returns all divisions of aaf that arise from the given extension.
boolean	Division.isValid(Collection<Extension<DungTheory>> exts)	Checks whether this division is valid wrt.
boolean	Division.isValid(Extension<DungTheory> ext)	Checks whether this division is valid wrt.

Constructor parameters in org.tweetyproject.arg.dung.divisions with type arguments of type DungTheory

Modifier	Constructor	Description
	Division(Extension<DungTheory> p, Extension<DungTheory> v)	Creates a new division for the given parameters.

Uses of DungTheory in org.tweetyproject.arg.dung.equivalence

Classes in org.tweetyproject.arg.dung.equivalence that implement interfaces with type arguments of type DungTheory

Modifier and Type	Class	Description
class	IdentityEquivalence	This class defines 'syntactic' equivalence of Argumentation Frameworks, i.e., it checks whether two AFs have exactly the same arguments and attacks.
class	SerialisationEquivalence	This class defines 'Serialisation' equivalence for Argumentation Frameworks wrt.
class	StandardEquivalence	This class defines 'standard' equivalence for Argumentation Frameworks wrt.
class	StrongEquivalence	This class defines strong equivalence for argumentation frameworks wrt.
class	StrongExpansionEquivalence	This class defines strong expansion equivalence for argumentation frameworks wrt.

Methods in org.tweetyproject.arg.dung.equivalence with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	IdentityEquivalence.isEquivalent(DungTheory obj1, DungTheory obj2)
boolean	SerialisationEquivalence.isEquivalent(DungTheory obj1, DungTheory obj2)
boolean	StandardEquivalence.isEquivalent(DungTheory obj1, DungTheory obj2)
boolean	StrongEquivalence.isEquivalent(DungTheory theory1, DungTheory theory2)
boolean	StrongExpansionEquivalence.isEquivalent(DungTheory theory1, DungTheory theory2)

Method parameters in org.tweetyproject.arg.dung.equivalence with type arguments of type DungTheory

Modifier and Type	Method	Description
boolean	IdentityEquivalence.isEquivalent(Collection<DungTheory> objects)
boolean	SerialisationEquivalence.isEquivalent(Collection<DungTheory> objects)
boolean	StandardEquivalence.isEquivalent(Collection<DungTheory> objects)
boolean	StrongEquivalence.isEquivalent(Collection<DungTheory> objects)
boolean	StrongExpansionEquivalence.isEquivalent(Collection<DungTheory> theories)

Uses of DungTheory in org.tweetyproject.arg.dung.equivalence.kernel

Methods in org.tweetyproject.arg.dung.equivalence.kernel that return DungTheory

Modifier and Type	Method	Description
DungTheory	EquivalenceKernel.getKernel(DungTheory theory)	Computes the kernel of the given AF

Methods in org.tweetyproject.arg.dung.equivalence.kernel with parameters of type DungTheory

Modifier and Type	Method	Description
DungTheory	EquivalenceKernel.getKernel(DungTheory theory)	Computes the kernel of the given AF
Collection<Attack>	AdmissibleKernel.getRedundantAttacks(DungTheory theory)
Collection<Attack>	CompleteKernel.getRedundantAttacks(DungTheory theory)
abstract Collection<Attack>	EquivalenceKernel.getRedundantAttacks(DungTheory theory)	Computes the set of redundant attacks, i.e., all attacks that are removed in order to retrieve the kernel of the given AF
Collection<Attack>	GroundedKernel.getRedundantAttacks(DungTheory theory)
Collection<Attack>	StableKernel.getRedundantAttacks(DungTheory theory)
Collection<Attack>	StrongExpansionAdmissibleKernel.getRedundantAttacks(DungTheory theory)
Collection<Attack>	StrongExpansionCompleteKernel.getRedundantAttacks(DungTheory theory)
Collection<Attack>	StrongExpansionGroundedKernel.getRedundantAttacks(DungTheory theory)

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

Methods in org.tweetyproject.arg.dung.examples that return DungTheory

Modifier and Type	Method	Description
static DungTheory	DungTheoryPlotterExample.example1()	Generates the first example of an argumentation framework.
static DungTheory	IndependenceExample.example1()	Example AF from Figure 2
static DungTheory	QualifiedSemanticsReasonerExample.example1()	Creates and returns an example of a Dung argumentation framework (Dung Theory).
static DungTheory	SerialisedExtensionReasonerExample.example1()	Builds an example argumentation framework
static DungTheory	DungTheoryPlotterExample.example2()	Generates the second example of an argumentation framework.
static DungTheory	QualifiedSemanticsReasonerExample.example2()	Creates and returns an example of a Dung argumentation framework (Dung Theory).
static DungTheory	SerialisedExtensionReasonerExample.example2()	Builds an example argumentation framework
static DungTheory	DungTheoryPlotterExample.example3()	Generates the third example of an argumentation framework.
static DungTheory	QualifiedSemanticsReasonerExample.example3()	Creates and returns an example of a Dung argumentation framework (Dung Theory).
static DungTheory	SerialisedExtensionReasonerExample.example3()	Builds an example argumentation framework

Uses of DungTheory in org.tweetyproject.arg.dung.independence

Methods in org.tweetyproject.arg.dung.independence with parameters of type DungTheory

Modifier and Type	Method	Description
static SimpleGraph<Argument>	Independence.computeDGraph(DungTheory theory)	Transform the given AF into a DAG (D-graph) by adding new meta argument for each strongly connected component
static boolean	Independence.isIndependent(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC)	Compute whether argsA and argsB are independent given argsC in the given AF argsA, argsB and argsC are disjoint
static boolean	Independence.isIndependent(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC, boolean pruneOutAttacks)	Compute whether argsA and argsB are independent given argsC in the given AF argsA, argsB and argsC are disjoint
static Collection<Collection<Argument>>	Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB)	Compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjoint
static Collection<Collection<Argument>>	Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, boolean pruneOutAttacks)	Compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjoint

Uses of DungTheory in org.tweetyproject.arg.dung.ldo.semantics

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.dung.ldo.semantics

Modifier and Type	Class	Description
class	LdoInterpretation	This class models an LDO interpretation, i.e., a pair of an argumentation framework and (possibly) an extension.

Methods in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	LdoInterpretation.satisfies(DungTheory beliefBase)

Constructors in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheory

Modifier	Constructor	Description
	LdoInterpretation(DungTheory theory, Extension ext, Semantics semantics)	Creates a new interpretation
	LdoInterpretation(DungTheory theory, Semantics semantics)	Creates a new interpretation

Uses of DungTheory in org.tweetyproject.arg.dung.ldo.syntax

Methods in org.tweetyproject.arg.dung.ldo.syntax that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	LdoFormula.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this formula, i.e.

Methods in org.tweetyproject.arg.dung.ldo.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	LdoFormula.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this formula, i.e.

Uses of DungTheory in org.tweetyproject.arg.dung.learning

Methods in org.tweetyproject.arg.dung.learning that return DungTheory

Modifier and Type	Method	Description
DungTheory	AFLearner.getModel()	compute an argumentation framework that satisfy the internal acceptance conditions
DungTheory	OptimizedParallelAFLearner.getModel()	compute a single model that satisfies all attack constraints computation for each argument constraint is independent and thus can be done in parallel
DungTheory	SimpleAFLearner.getModel()
DungTheory	NiskanenTheorySynthesizer.learnExamples(Map<Extension<DungTheory>,Integer> positiveExamples, Map<Extension<DungTheory>,Integer> negativeExamples)	learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examples
DungTheory	TheoryLearner.learnExamples(Map<Labeling,Integer> positiveExamples, Map<Labeling,Integer> negativeExamples)	learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examples
DungTheory	ImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings)	learn theory without pruning discarded attacks
DungTheory	ImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings, boolean prune, int threshold)	learn random labelings from the given List until no undecided attacks are left in the theory
DungTheory	RiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings)	learn theory without pruning discarded attacks
DungTheory	RiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings, boolean prune, int threshold)	learn random labelings from the given List until no undecided attacks are left in the theory

Methods in org.tweetyproject.arg.dung.learning that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>	ExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>	ExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>	ExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>>	ExtendedExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>>	ExtendedExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>>	ExtendedExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>,Collection<DungTheory>>>>	ExtendedExampleFinder.getExamples(int minArgs, int maxArgs)	compute a tree like structure of examples.
Collection<DungTheory>	AFLearner.getModels()	compute all argumentation frameworks that satisfy the internal acceptance conditions
Collection<DungTheory>	OptimizedParallelAFLearner.getModels()
Collection<DungTheory>	SimpleAFLearner.getModels()	compute the set of argumentation frameworks that satisfy all acceptance conditions 1.

Method parameters in org.tweetyproject.arg.dung.learning with type arguments of type DungTheory

Modifier and Type	Method	Description
DungTheory	NiskanenTheorySynthesizer.learnExamples(Map<Extension<DungTheory>,Integer> positiveExamples, Map<Extension<DungTheory>,Integer> negativeExamples)	learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examples
void	ExampleFinder.showExamples(Collection<Extension<DungTheory>> extensions)	prints a theory for each set of extensions (of the second semantics) that can occur, given the set of extensions for the first semantics
void	ExtendedExampleFinder.showExamples(Collection<Extension<DungTheory>> extensions1, Collection<Extension<DungTheory>> extensions2)	prints a theory for each set of extensions (of the third semantics) that can occur, given the set of extensions for the first and second semantics

Uses of DungTheory in org.tweetyproject.arg.dung.learning.syntax

Methods in org.tweetyproject.arg.dung.learning.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	Entity.getHiddenAF()	return the hidden AF should not be used normally

Methods in org.tweetyproject.arg.dung.learning.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	Entity.verifyFramework(DungTheory theory, Collection<Input> inputs)	verify if the given theory is equivalent to the hidden framework w.r.t.

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

Modifier	Constructor	Description
	Entity(DungTheory theory)	initialize the entity with the given AF
	Entity(DungTheory theory, List<Input> inputs)
	Input(DungTheory theory, Extension extension, Semantics semantics)	initialize input labeling from the given extension

Uses of DungTheory in org.tweetyproject.arg.dung.parser

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.dung.parser

Modifier and Type	Class	Description
class	AbstractDungParser	This abstract class gives a template for parsers of files representing abstract argumentation frameworks.

Methods in org.tweetyproject.arg.dung.parser that return DungTheory

Modifier and Type	Method	Description
abstract DungTheory	AbstractDungParser.parse(Reader reader)	Parses the given file into an abstract argumentation framework
DungTheory	ApxParser.parse(Reader reader)
DungTheory	CnfParser.parse(Reader reader)
DungTheory	Iccma23Parser.parse(Reader reader)
DungTheory	TgfParser.parse(Reader reader)
DungTheory	AbstractDungParser.parseBeliefBase(Reader reader)
DungTheory	ApxParser.parseIgnoreComments(Reader reader, boolean printCommands)	Parses an argumentation framework from a reader source with options to ignore comments and optionally print commands.
static DungTheory	AbstractDungParser.parseJavaStringRepresentation(String str)	Parses a representation of the form "\lt; {a,b,c},[(a,b),(b,c)]\gt;" which is given by DungTheory.toString();

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

Methods in org.tweetyproject.arg.dung.principles that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<Extension<DungTheory>>	NonInterferencePrinciple.getIsolatedSets(DungTheory theory)	Method for calculating isolated sets in a given theory A set E is isolated in a theory AF iff there exists no argument a in {AF \ E}, with a attacks E and there exists no argument b in E, with b attacks {AF \ E}.
Collection<Extension<DungTheory>>	DirectionalityPrinciple.getUnattackedSets(DungTheory theory)	utility method for calculating unattacked sets in a given theory a set E is unattacked in theory iff there exists no argument a in theory \ E, with a attacks E

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

Modifier and Type	Method	Description
Collection<Extension<DungTheory>>	NonInterferencePrinciple.getIsolatedSets(DungTheory theory)	Method for calculating isolated sets in a given theory A set E is isolated in a theory AF iff there exists no argument a in {AF \ E}, with a attacks E and there exists no argument b in E, with b attacks {AF \ E}.
Collection<Extension<DungTheory>>	DirectionalityPrinciple.getUnattackedSets(DungTheory theory)	utility method for calculating unattacked sets in a given theory a set E is unattacked in theory iff there exists no argument a in theory \ E, with a attacks E

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

Subinterfaces with type arguments of type DungTheory in org.tweetyproject.arg.dung.reasoner

Modifier and Type	Interface	Description
interface	KOptimisationReasoner	Interface for reasoner capable of optimising k extensions.

Classes in org.tweetyproject.arg.dung.reasoner that implement interfaces with type arguments of type DungTheory

Modifier and Type	Class	Description
class	AbstractDungReasoner	Ancestor class for all AAF reasoners.
class	AbstractExtensionReasoner	Ancestor class for all extension-based reasoners.
class	AbstractExtensionReasoner	Ancestor class for all extension-based reasoners.
class	StratifiedLabelingReasoner	This class implements a stratified labeling reasoner.

Methods in org.tweetyproject.arg.dung.reasoner that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Set<DungTheory>	SimpleResolutionBasedReasoner.computeFRAF(DungTheory start)
Collection<Collection<Extension<DungTheory>>>	IncompleteReasoner.getAllModels(IncompleteTheory theory)
Extension<DungTheory>	ExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory)	computes the set of conflicts occurring inside ext
Extension<DungTheory>	ExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
Collection<Extension<DungTheory>>	SimpleNaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all maximal conflict-free sets of bbase
Extension<DungTheory>	AbstractSatExtensionReasoner.getModel(DungTheory bbase)
List<Extension<DungTheory>>	ExtensionRankingReasoner.getModel(DungTheory theory)	returns the lowest rank of the "getModels" method
Extension<DungTheory>	ProboI23Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	ProboReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	QualifiedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SccCF2Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SCF2Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SCOOCNaiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SemiQualifiedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SerialisedExtensionReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleConflictFreeReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleEagerReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleGroundedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleIdealReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleInitialReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleNaiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimplePreferredReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleResolutionBasedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSccCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSccRecursiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSemiStableReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleStableReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleStageReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SolidAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	Stage2Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	StronglyAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	VacuousReductReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyAdmissibleReasoner.getModel(DungTheory bbase)	returns one weakly admissible set of bbase
Extension<DungTheory>	WeaklyCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyGroundedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyPreferredReasoner.getModel(DungTheory bbase)
Collection<Extension<DungTheory>>	AbstractSatExtensionReasoner.getModels(DungTheory bbase)
List<List<Extension<DungTheory>>>	ExtensionRankingReasoner.getModels(DungTheory theory)	compute the ordering over all subsets of theory wrt.
Collection<Extension<DungTheory>>	ProboI23Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	ProboReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	QualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SccCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SCOOCNaiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SemiQualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SerialisedExtensionReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleConflictFreeReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleEagerReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleGroundedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleIdealReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleInitialReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleNaiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimplePreferredReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleResolutionBasedReasoner.getModels(DungTheory bbase)	compute the extension with the base semantics of this.semantic
Collection<Extension<DungTheory>>	SimpleSccCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleSccRecursiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleSemiStableReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleStableReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleStageReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SolidAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	Stage2Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	StronglyAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	VacuousReductReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyAdmissibleReasoner.getModels(DungTheory bbase)	computes all weakly admissible sets of bbase.
Collection<Extension<DungTheory>>	WeaklyCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyGroundedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyPreferredReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	IncompleteReasoner.getNecessaryModels(IncompleteTheory theory)	Computes the set of necessary extensions
Collection<Extension<DungTheory>>	IncompleteReasoner.getPossibleModels(IncompleteTheory theory)	Computes the set of possible extensions
Collection<Extension<DungTheory>>	SerialisedExtensionReasoner.getSelection(Collection<Extension<DungTheory>> ua, Collection<Extension<DungTheory>> uc, Collection<Extension<DungTheory>> c)	Applies a selection function to compute a collection of preferred extensions from given sets of extensions.
Extension<DungTheory>	ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
Extension<DungTheory>	ExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments in ext, which are not defended by ext against outside attackers
static Map<SimpleInitialReasoner.Initial,Collection<Extension<DungTheory>>>	SimpleInitialReasoner.partitionInitialSets(DungTheory theory)	Helper function that computes the initial sets of F and labels them in three categories
Pair<Boolean,Extension<DungTheory>>	ProboI23Reasoner.queryW(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)

Methods in org.tweetyproject.arg.dung.reasoner with parameters of type DungTheory

Modifier and Type	Method	Description
Set<DungTheory>	SimpleResolutionBasedReasoner.computeFRAF(DungTheory start)
static boolean	MaxSatKAdmissibleAstReasoner.defendsAgainstOutsideAttackers(DungTheory aaf, Collection<Argument> set)	Returns "true" if set defends against all attacks from outside of set
static int	MaxSatKAdmissibleAstReasoner.eval(DungTheory aaf, Collection<Argument> set)	Returns the maximal k such that the given extension is a k-adm* extension of the given AAF.
static int	MaxSatKAdmissibleReasoner.eval(DungTheory aaf, Collection<Argument> set)	Returns the maximal k such that the given extension is a k-adm# extension of the given AAF.
static int	MaxSatKStableAstReasoner.eval(DungTheory aaf, Set<Argument> set)	Returns the maximal k such that the given extension is a k-stable* extension of the given AAF.
static int	MaxSatKStableReasoner.eval(DungTheory aaf, Set<Argument> set)	Returns the maximal k such that the given extension is a k-stable extension of the given AAF.
abstract Collection<Argument>	AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)	Returns the set of acceptable arguments of this reasoner.
Collection<Argument>	EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	FudgeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	IaqAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeemAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)	computes all conflict-free sets, which attack any argument in ext
Set<Argument>	WeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)	finds the set of arguments S = {a | there exists an edge between a and argument}
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeCandidateSets(DungTheory bbase, Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates and all arguments are relevant an argument is considered relevant iff it attacks any argument in the same component as the given argument A
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates
Extension<DungTheory>	ExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory)	computes the set of conflicts occurring inside ext
Extension<DungTheory>	ExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
Collection<Extension<DungTheory>>	SimpleNaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all maximal conflict-free sets of bbase
Extension<DungTheory>	AbstractSatExtensionReasoner.getModel(DungTheory bbase)
List<Extension<DungTheory>>	ExtensionRankingReasoner.getModel(DungTheory theory)	returns the lowest rank of the "getModels" method
Extension<DungTheory>	ProboI23Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	ProboReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	QualifiedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SccCF2Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SCF2Reasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SCOOCNaiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SemiQualifiedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SerialisedExtensionReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleConflictFreeReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleEagerReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleGroundedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleIdealReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleInitialReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleNaiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimplePreferredReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleResolutionBasedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSccCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSccRecursiveReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleSemiStableReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleStableReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SimpleStageReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	SolidAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	Stage2Reasoner.getModel(DungTheory bbase)
StratifiedLabeling	StratifiedLabelingReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	StronglyAdmissibleReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	VacuousReductReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyAdmissibleReasoner.getModel(DungTheory bbase)	returns one weakly admissible set of bbase
Extension<DungTheory>	WeaklyCompleteReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyGroundedReasoner.getModel(DungTheory bbase)
Extension<DungTheory>	WeaklyPreferredReasoner.getModel(DungTheory bbase)
Collection<Extension<DungTheory>>	AbstractSatExtensionReasoner.getModels(DungTheory bbase)
List<List<Extension<DungTheory>>>	ExtensionRankingReasoner.getModels(DungTheory theory)	compute the ordering over all subsets of theory wrt.
Collection<Extension<DungTheory>>	ProboI23Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	ProboReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	QualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SccCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SCOOCNaiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SemiQualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SerialisedExtensionReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleConflictFreeReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleEagerReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleGroundedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleIdealReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleInitialReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleNaiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimplePreferredReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleResolutionBasedReasoner.getModels(DungTheory bbase)	compute the extension with the base semantics of this.semantic
Collection<Extension<DungTheory>>	SimpleSccCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleSccRecursiveReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleSemiStableReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleStableReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SimpleStageReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	SolidAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	Stage2Reasoner.getModels(DungTheory bbase)
Collection<StratifiedLabeling>	StratifiedLabelingReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	StronglyAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	VacuousReductReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyAdmissibleReasoner.getModels(DungTheory bbase)	computes all weakly admissible sets of bbase.
Collection<Extension<DungTheory>>	WeaklyCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyGroundedReasoner.getModels(DungTheory bbase)
Collection<Extension<DungTheory>>	WeaklyPreferredReasoner.getModels(DungTheory bbase)
PlBeliefSet	AbstractSatExtensionReasoner.getPropositionalCharacterisation(DungTheory aaf)	Creates a propositional representation of the set of labelings of the given Dung theory that are consistent with the given semantics.
Collection<SerialisationSequence>	SerialisedExtensionReasoner.getSequences(DungTheory bbase)	Computes the set of serialisation sequences wrt.
SerialisationGraph	SerialisedExtensionReasoner.getSerialisationGraph(DungTheory bbase)	Creates a graph, visualizing the transition states of the serialisation process, which creates all serialisable extensions according to the specified semantics of the specified framework.
Collection<Argument>	SolidAdmissibleReasoner.getSolidlyDefended(Extension<DungTheory> ext, DungTheory theory)
Extension<DungTheory>	ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
Extension<DungTheory>	ExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments in ext, which are not defended by ext against outside attackers
boolean	SimpleInitialReasoner.isChallenged(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called challenged in F iff there is some other initial set of F which attacks S
boolean	SolidAdmissibleReasoner.isSolidlyDefendedBy(Argument arg, Extension<DungTheory> ext, DungTheory theory)
boolean	SerialisedExtensionReasoner.isTerminal(DungTheory theory, Extension<DungTheory> extension)	Checks whether a given extension is terminal in the specified Dung theory.
boolean	SimpleInitialReasoner.isUnattacked(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called unattacked iff there is no attacker of S in F
boolean	SimpleInitialReasoner.isUnchallenged(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called unchallenged in F iff S is not unattacked and there is no other initial set of F which attacks S
boolean	WeaklyCompleteReasoner.isWeaklyDefendedBy(Collection<Argument> X, Collection<Argument> E, DungTheory theory)	Computes whether E w-defends X i.e.
static Map<SimpleInitialReasoner.Initial,Collection<Extension<DungTheory>>>	SimpleInitialReasoner.partitionInitialSets(DungTheory theory)	Helper function that computes the initial sets of F and labels them in three categories
Boolean	AbstractAcceptabilityReasoner.query(DungTheory beliefbase, Argument formula)
abstract Boolean	AbstractDungReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
Integer	GCF_GreedyKApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	GFR_GreedyKApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	GgAdmissibleApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	GgAdmissibleAstApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	GsAdmissibleApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	GsAdmissibleAstApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	KOptimisationReasoner.query(DungTheory aaf, Argument arg)
Integer	MaxSatKAdmissibleAstReasoner.query(DungTheory aaf, Argument arg)
Integer	MaxSatKAdmissibleReasoner.query(DungTheory aaf, Argument arg)
Integer	MaxSatKStableAstReasoner.query(DungTheory aaf, Argument arg)
Integer	MaxSatKStableReasoner.query(DungTheory aaf, Argument arg)
Boolean	ProboI23Reasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
Boolean	ProboReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
Boolean	SatCompleteReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
Integer	SCF_GreedyKApproximationReasoner.query(DungTheory aaf, Argument arg)
Integer	SFR_GreedyKApproximationReasoner.query(DungTheory aaf, Argument arg)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
Pair<Boolean,Extension<DungTheory>>	ProboI23Reasoner.queryW(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)

Method parameters in org.tweetyproject.arg.dung.reasoner with type arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	ExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory)	computes the set of conflicts occurring inside ext
Extension<DungTheory>	ExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
Collection<Extension<DungTheory>>	SerialisedExtensionReasoner.getSelection(Collection<Extension<DungTheory>> ua, Collection<Extension<DungTheory>> uc, Collection<Extension<DungTheory>> c)	Applies a selection function to compute a collection of preferred extensions from given sets of extensions.
Collection<Argument>	SolidAdmissibleReasoner.getSolidlyDefended(Extension<DungTheory> ext, DungTheory theory)
Extension<DungTheory>	ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
Extension<DungTheory>	ExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory)	computes the set of arguments in ext, which are not defended by ext against outside attackers
boolean	SimpleInitialReasoner.isChallenged(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called challenged in F iff there is some other initial set of F which attacks S
boolean	SolidAdmissibleReasoner.isSolidlyDefendedBy(Argument arg, Extension<DungTheory> ext, DungTheory theory)
boolean	SerialisedExtensionReasoner.isTerminal(DungTheory theory, Extension<DungTheory> extension)	Checks whether a given extension is terminal in the specified Dung theory.
boolean	SimpleInitialReasoner.isUnattacked(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called unattacked iff there is no attacker of S in F
boolean	SimpleInitialReasoner.isUnchallenged(Extension<DungTheory> ext, DungTheory theory)	An initial set S is called unchallenged in F iff S is not unattacked and there is no other initial set of F which attacks S

Uses of DungTheory in org.tweetyproject.arg.dung.semantics

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.dung.semantics

Modifier and Type	Class	Description
class	StratifiedLabeling	This class implements stratified labelings as in [Thimm, Kern-Isberner, 2013].

Methods in org.tweetyproject.arg.dung.semantics with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	StratifiedLabeling.satisfies(DungTheory beliefBase)

Uses of DungTheory in org.tweetyproject.arg.dung.serialisability.semantics

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.dung.serialisability.semantics

Modifier and Type	Class	Description
class	SerialisationSequence	Representation of a serialisation sequence, i.e., a sequence of initial sets of the respective reducts.

Methods in org.tweetyproject.arg.dung.serialisability.semantics that return DungTheory

Modifier and Type	Method	Description
DungTheory	SerialisationState.getTheory()	Return the AF corresponding to this state

Methods in org.tweetyproject.arg.dung.serialisability.semantics that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	SerialisationSequence.getArgumentsOfStatus(ArgumentStatus status)
Extension<DungTheory>	SerialisationSequence.getExtension()	Computes the corresponding extension as the union of all the sets in the sequence
Extension<DungTheory>	SerialisationState.getExtension()	Return the extension corresponding to this state
Collection<Extension<DungTheory>>	SerialisationGraph.getExtensions()	Return the extension that the represented serialisation sequences correspond to

Method parameters in org.tweetyproject.arg.dung.serialisability.semantics with type arguments of type DungTheory

Modifier and Type	Method	Description
SerialisationState	SerialisationGraph.getNodeForExtension(Extension<DungTheory> extension)	Return the node of this graph that corresponds to the given extension

Constructors in org.tweetyproject.arg.dung.serialisability.semantics with parameters of type DungTheory

Modifier	Constructor	Description
	SerialisationGraph(DungTheory theory, SerialisedExtensionReasoner reasoner)	Construct a serialisation graph for the given argumentation framework and serialisation reasoner
	SerialisationGraph(DungTheory theory, Semantics semantics)	Construct a serialisation graph for the given argumentation framework and semantics
	SerialisationState(DungTheory theory, Extension<DungTheory> extension)	Initializes a serialisation state for the given theory and extension with terminal set to false
	SerialisationState(DungTheory theory, Extension<DungTheory> extension, boolean terminal)	Initializes a new serialisation state for the given theory and extension and terminal value

Constructor parameters in org.tweetyproject.arg.dung.serialisability.semantics with type arguments of type DungTheory

Modifier	Constructor	Description
	SerialisationState(DungTheory theory, Extension<DungTheory> extension)	Initializes a serialisation state for the given theory and extension with terminal set to false
	SerialisationState(DungTheory theory, Extension<DungTheory> extension, boolean terminal)	Initializes a new serialisation state for the given theory and extension and terminal value

Uses of DungTheory in org.tweetyproject.arg.dung.serialisability.syntax

Methods in org.tweetyproject.arg.dung.serialisability.syntax that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<Extension<DungTheory>>	SelectionFunction.execute(Set<Extension<DungTheory>> ua, Set<Extension<DungTheory>> uc, Set<Extension<DungTheory>> c)	Select a subset of the initial sets of the AF, i.e.

Methods in org.tweetyproject.arg.dung.serialisability.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	TerminationFunction.execute(DungTheory theory, Extension<DungTheory> extension)	Determines whether the current state represents an extension wrt.

Method parameters in org.tweetyproject.arg.dung.serialisability.syntax with type arguments of type DungTheory

Modifier and Type	Method	Description
Collection<Extension<DungTheory>>	SelectionFunction.execute(Set<Extension<DungTheory>> ua, Set<Extension<DungTheory>> uc, Set<Extension<DungTheory>> c)	Select a subset of the initial sets of the AF, i.e.
boolean	TerminationFunction.execute(DungTheory theory, Extension<DungTheory> extension)	Determines whether the current state represents an extension wrt.

Uses of DungTheory in org.tweetyproject.arg.dung.serialisability.util

Methods in org.tweetyproject.arg.dung.serialisability.util with parameters of type DungTheory

Modifier and Type	Method	Description
static void	SerialisationAnalysisPlotter.plotAnalyses(Semantics[] semantics, DungTheory[] frameworks, String title, int width, int height)	Plots specified frameworks and their associated serialisation graphs for the specified semantics.
static void	SerialisationAnalysisPlotter.plotAnalyses(DungTheory framework, SerialisationGraph[] graphs, String title, int width, int height)	Plots specified analyses of the serialising generation of extensions, each in a separate frame.
static PlotterMultiFrame	SerialisationAnalysisPlotter.plotAnalysesOneFrame(Semantics[] semantics, DungTheory[] frameworks, String[] titles, int width, int height)	Plots specified frameworks and their associated serialisation graphs for the specified semantics.

Method parameters in org.tweetyproject.arg.dung.serialisability.util with type arguments of type DungTheory

Modifier and Type	Method	Description
static void	SerialisationAnalysisPlotter.plotAnalyses(HashMap<DungTheory,SerialisationGraph[]> mapAFtoGraphs, String title, int width, int height)	Plots specified frameworks and their associated serialisation graphs for the specified semantics.
static PlotterMultiFrame	SerialisationAnalysisPlotter.plotAnalysesOneFrame(HashMap<DungTheory,SerialisationGraph[]> mapAFtoGraphs, String title, int width, int height)	Plots specified frameworks and their associated serialisation graphs for the specified semantics.

Uses of DungTheory in org.tweetyproject.arg.dung.syntax

Subclasses of DungTheory in org.tweetyproject.arg.dung.syntax

Modifier and Type	Class	Description
class	ClaimBasedTheory	implements claim based theory see: The Complexity Landscape of Claim-Augmented Argumentation Frameworks (Wolfgang Dvoˇr´ak Alexander Greßler Anna Rapberger StefanWoltran )
class	IncompleteTheory	implementation of incomplete argumentation frameworks
class	WeightedDungTheory	Minimalistic Implementation of a weighted argumentation theory used for learning argumentation theories from labelings

Classes in org.tweetyproject.arg.dung.syntax that implement interfaces with type arguments of type DungTheory

Modifier and Type	Class	Description
class	DungTheory	This class implements an abstract argumentation theory in the sense of Dung.

Methods in org.tweetyproject.arg.dung.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	DungTheory.clone()
DungTheory	DungTheory.getComplementGraph(int selfloops)
DungTheory	WeightedDungTheory.getDungTheory()	compute Dung Theory only containing attacks with weights greater than zero
DungTheory	WeightedDungTheory.getDungTheory(double threshold)	compute Dung Theory only containing attacks with weight above the given threshold
DungTheory	DungTheory.getReduct(Collection<Argument> arguments)	computes the reduct of bbase wrt.
DungTheory	DungTheory.getReduct(Argument arg)	computes the reduct of this wrt.

Methods in org.tweetyproject.arg.dung.syntax that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	DungTheory.faf(Extension<DungTheory> extension)	The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt.
Collection<DungTheory>	IncompleteTheory.getAllCompletions()	Generates all possible completions of the current Dung theory based on uncertain arguments and attacks.

Methods in org.tweetyproject.arg.dung.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	DungTheory.add(DungTheory theory)	Adds all arguments and attacks of the given theory to this theory
int	DungTheory.compareTo(DungTheory o)

Method parameters in org.tweetyproject.arg.dung.syntax with type arguments of type DungTheory

Modifier and Type	Method	Description
boolean	DungTheory.equalsIn(HashSet<DungTheory> setOfEquals)	Method to check if an equal object to this object is contained in the specified set
Extension<DungTheory>	DungTheory.faf(Extension<DungTheory> extension)	The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt.
Set<Claim>	ClaimBasedTheory.getClaims(Extension<DungTheory> ext)	get all claims of a given extension
boolean	DungTheory.isAcceptable(Argument argument, Extension<DungTheory> ext)	returns true if every attacker on argument is attacked by some accepted argument wrt.
boolean	DungTheory.isAdmissible(Extension<DungTheory> ext)	returns true if every accepted argument of this is defended by some accepted argument wrt.
boolean	DungTheory.isAttacked(Extension<DungTheory> ext1, Extension<DungTheory> ext2)	returns true if some argument of ext2 attacks some argument in ext1
boolean	DungTheory.isComplete(Extension<DungTheory> e)	Checks whether the given extension is complete wrt.
boolean	DungTheory.isConflictFree(Extension<DungTheory> ext)	returns true if no accepted argument attacks another accepted one in this interpretation wrt.
boolean	DungTheory.isStable(Extension<DungTheory> e)	Checks whether the given extension is stable wrt.
void	IncompleteTheory.merge(HashSet<DungTheory> theories)	merges DungTheories to one incomplete theory

Uses of DungTheory in org.tweetyproject.arg.dung.util

Subinterfaces with type arguments of type DungTheory in org.tweetyproject.arg.dung.util

Modifier and Type	Interface	Description
interface	DungTheoryGenerator	Class implementing this interface provide the capability to generate Dung theories.

Methods in org.tweetyproject.arg.dung.util that return DungTheory

Modifier and Type	Method	Description
DungTheory	DefaultDungTheoryGenerator.next()
DungTheory	DefaultDungTheoryGenerator.next(Argument arg)
DungTheory	DungTheoryGenerator.next()
DungTheory	DungTheoryGenerator.next(Argument arg)	Generates a new Dung theory where the given argument is enforced to be in the grounded extension
DungTheory	EnumeratingDungTheoryGenerator.next()
DungTheory	EnumeratingDungTheoryGenerator.next(Argument arg)
DungTheory	FileDungTheoryGenerator.next()
DungTheory	FileDungTheoryGenerator.next(Argument arg)
DungTheory	IsoSafeEnumeratingDungTheoryGenerator.next()
DungTheory	IsoSafeEnumeratingDungTheoryGenerator.next(Argument arg)
DungTheory	KwtDungTheoryGenerator.next()
DungTheory	KwtDungTheoryGenerator.next(Argument arg)
DungTheory	PodlaszewskiCaminadaDungTheoryGenerator.next()
DungTheory	PodlaszewskiCaminadaDungTheoryGenerator.next(Argument arg)
DungTheory	PrSigBasedDungTheoryGenerator.next()
DungTheory	PrSigBasedDungTheoryGenerator.next(Argument arg)

Methods in org.tweetyproject.arg.dung.util with parameters of type DungTheory

Modifier and Type	Method	Description
static void	DungTheoryPlotter.plotFramework(DungTheory framework, int width, int height, String titleGraph)	Plots the specified framework in a new created frame.
static void	DungTheoryPlotter.plotFramework(DungTheory framework, Plotter groundPlotter, String titleGraph)	Plots the specified framework in the frame of the specified plotter.

Method parameters in org.tweetyproject.arg.dung.util with type arguments of type DungTheory

Modifier and Type	Method	Description
static Collection<Argument>	Realizability.args(Collection<Extension<DungTheory>> exts)	Returns the set of all arguments appearing in some extension.
static boolean	Realizability.isAdmClosed(Collection<Extension<DungTheory>> exts)	Checks whether the given set is adm-closed, i.e., whether for each pair ext1, ext2 of extensions we have that if all a in ext1 and b in ext2 are a pair, then (ext1 union ext2) is also an extension.
static boolean	Realizability.isDownwardClosed(Collection<Extension<DungTheory>> exts)	Checks whether the set is downward-closed, i.e., if it contains each subset of each contained set.
static boolean	Realizability.isIncomparable(Collection<Extension<DungTheory>> exts)	Checks whether the given set is incomparable, i.e., whether for each pair ext1, ext2 of extensions we have that neither is a proper subset of the other.
static boolean	Realizability.isPair(Collection<Extension<DungTheory>> exts, Argument a, Argument b)	Checks whether the given pair of arguments is a pair in the extension set, i.e.
static boolean	Realizability.isPrefClosed(Collection<Extension<DungTheory>> exts)	Checks whether the given set if pref-closed, i.e., whether it is incomparable and adm-closed.
static boolean	Realizability.isTight(Collection<Extension<DungTheory>> exts)	Checks whether the given set is tight, i.e., whether for all extensions ext and each argument a, if (ext with a) is not in the set, there there is an argument b in ext such that (a,b) is not a pair.
static Collection<Set<Argument>>	Realizability.pairs(Collection<Extension<DungTheory>> exts)	Returns the set of sets of arguments {a,b}, s.t.
static void	DungTheoryPlotter.plotFramework(Collection<DungTheory> frameworks, int width, int height)	Plots the specified frameworks in a new created frame.

Constructors in org.tweetyproject.arg.dung.util with parameters of type DungTheory

Modifier	Constructor	Description
	DungTheoryPlotter(Plotter plotter, DungTheory argFramework)	Creates a new instance for plotting an abstract argumentation framework, also called DungTheory
	EnumeratingDilationGenerator(DungTheory frameworkOriginal)	Constructs a new dilation generator with a reference to an original Dung theory.

Constructor parameters in org.tweetyproject.arg.dung.util with type arguments of type DungTheory

Modifier	Constructor	Description
	FileDungTheoryGenerator(File[] files, Parser<DungTheory,?> parser, boolean loop)	Creates a new theory generator for the given files, which can be parsed by the given parser.
	FileDungTheoryGenerator(String path, String suffix, Parser<DungTheory,?> parser, boolean loop)	Creates a new theory generator for all files in the given folder with the given suffix, which can be parsed by the given parser.

Uses of DungTheory in org.tweetyproject.arg.dung.writer

Methods in org.tweetyproject.arg.dung.writer with parameters of type DungTheory

Modifier and Type	Method	Description
abstract void	AbstractDungWriter.write(DungTheory aaf, File f)	Writes the given file into an abstract argumentation framework
void	ApxWriter.write(DungTheory aaf, File f)
void	CnfWriter.write(DungTheory aaf, File f)
void	Iccma23Writer.write(DungTheory aaf, File f)
void	TgfWriter.write(DungTheory aaf, File f)

Uses of DungTheory in org.tweetyproject.arg.extended.syntax

Methods in org.tweetyproject.arg.extended.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	ExtendedTheory.flatten()	Transforms the extended theory into a standard dung theory by flattening the extended attacks via creating meta-arguments

Uses of DungTheory in org.tweetyproject.arg.prob.analysis

Constructors in org.tweetyproject.arg.prob.analysis with parameters of type DungTheory

Modifier	Constructor	Description
	PAInconsistencyMeasure(RealVectorNorm norm, DungTheory theory, PASemantics semantics)	Creates a new inconsinstency measure which uses the given norm and measures wrt.

Uses of DungTheory in org.tweetyproject.arg.prob.dynamics

Methods in org.tweetyproject.arg.prob.dynamics with parameters of type DungTheory

Modifier and Type	Method	Description
ProbabilisticExtension	AbstractPAChangeOperator.change(ProbabilisticExtension p, DungTheory theory)
abstract ProbabilisticExtension	AbstractPAChangeOperator.change(PartialProbabilityAssignment ppa, DungTheory theory)
ProbabilisticExtension	ChangeOperator.change(ProbabilisticExtension p, DungTheory theory)	Given a probabilistic extension and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state p.
ProbabilisticExtension	ChangeOperator.change(PartialProbabilityAssignment ppa, DungTheory theory)	Given a partial probability assignment ppa and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state ppa.
ProbabilisticExtension	PARevisionOperator.change(PartialProbabilityAssignment ppa, DungTheory theory)
ProbabilisticExtension	PAUpdateOperator.change(PartialProbabilityAssignment ppa, DungTheory theory)

Uses of DungTheory in org.tweetyproject.arg.prob.lotteries

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.prob.lotteries

Modifier and Type	Class	Description
class	SubgraphProbabilityFunction	Represents a probability function on the subgraphs of some Dung theory.

Methods in org.tweetyproject.arg.prob.lotteries that return DungTheory

Modifier and Type	Method	Description
DungTheory	ArgumentationLottery.getTheory()	Returns the used argumentation theory.
DungTheory	LdoArgumentationLottery.getTheory()	Returns the used argumentation theory.
DungTheory	SubgraphProbabilityFunction.getTheory()	Returns the theory of this probability function.

Methods in org.tweetyproject.arg.prob.lotteries with parameters of type DungTheory

Modifier and Type	Method	Description
Double	LdoUtilityFunction.getUtility(DungTheory theory, Semantics semantics)	Gets the utility of the given theory wrt.
Double	UtilityFunction.getUtility(DungTheory theory, Semantics semantics)	Gets the utility of the given theory wrt.
SubgraphProbabilityFunction	SubgraphProbabilityFunction.roughUpdate(DungTheory theory)	Updates this probability function with the given theory using "rough redistribution", cf.
SubgraphProbabilityFunction	SubgraphProbabilityFunction.simpleUpdate(DungTheory theory)	Updates this probability function with the given theory using "simple redistribution", cf.
SubgraphProbabilityFunction	SubgraphProbabilityFunction.stickyUpdate(DungTheory theory, double stickyCoefficient)	Updates this probability function with the given theory using "sticky redistribution", cf.

Constructors in org.tweetyproject.arg.prob.lotteries with parameters of type DungTheory

Modifier	Constructor	Description
	SubgraphProbabilityFunction(DungTheory theory)	Creates a new uniform probability function for the given theory, i.e.

Uses of DungTheory in org.tweetyproject.arg.prob.semantics

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.prob.semantics

Modifier and Type	Class	Description
class	ProbabilisticExtension	This class implements a probabilistic interpretation for Dung argumentation frameworks, cf.

Methods in org.tweetyproject.arg.prob.semantics that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	ProbabilisticExtension.geLowerCut(DungTheory theory, double delta)	Returns the lower cut of this probabilistic extension wrt.
Extension<DungTheory>	ProbabilisticExtension.getAllArguments()	Returns the set of all arguments appearing.
Extension<DungTheory>	ProbabilisticExtension.getUpperCut(DungTheory theory, double delta)	Returns the upper cut of this probabilistic extension wrt.

Methods in org.tweetyproject.arg.prob.semantics with parameters of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	ProbabilisticExtension.geLowerCut(DungTheory theory, double delta)	Returns the lower cut of this probabilistic extension wrt.
static ProbabilisticExtension	ProbabilisticExtension.getCharacteristicProbabilisticExtension(DungTheory theory, AbstractArgumentationInterpretation i)	Returns the characteristic probabilistic extension of the given interpretation, i.e.
abstract Collection<Statement>	AbstractPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	CoherentPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	FoundedPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	InvolutaryPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	JustifiablePASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	NeutralPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	OptimisticPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	PASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)	Returns the mathematical statement corresponding to the satisfaction of the given theory wrt.
Collection<Statement>	RationalPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	SemiFoundedPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Collection<Statement>	SemiOptimisticPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Extension<DungTheory>	ProbabilisticExtension.getUpperCut(DungTheory theory, double delta)	Returns the upper cut of this probabilistic extension wrt.
abstract boolean	AbstractPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	CoherentPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	FoundedPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	InvolutaryPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	JustifiablePASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	NeutralPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	OptimisticPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	PASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)	Checks whether the given probabilistic extension satisfies the given argumentation theory wrt.
boolean	RationalPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	SemiFoundedPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)
boolean	SemiOptimisticPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory)

Uses of DungTheory in org.tweetyproject.arg.prob.syntax

Subclasses of DungTheory in org.tweetyproject.arg.prob.syntax

Modifier and Type	Class	Description
class	ProbabilisticArgumentationFramework	This class implements the probabilistic argumentation framework approach of [Li, Oren, Norman.

Methods in org.tweetyproject.arg.prob.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	ProbabilisticArgumentationFramework.sample()	Samples a random DungTheory from this framework wrt.

Methods in org.tweetyproject.arg.prob.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
Probability	ProbabilisticArgumentationFramework.getProbability(DungTheory aaf)	Computes the probability of the given AAF wrt.

Uses of DungTheory in org.tweetyproject.arg.rankings.postulates

Method parameters in org.tweetyproject.arg.rankings.postulates with type arguments of type DungTheory

Modifier and Type	Method	Description
boolean	RaAbstraction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaAdditionOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaAttackVsFullDefense.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaCardinalityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaDistDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaIncreaseOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaIncreaseOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaIndependence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
abstract boolean	RankingPostulate.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)	Return status
boolean	RaNonAttackedEquivalence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaQualityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaSelfContradiction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaSigmaCompatibility.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaSkeptSigmaCompatibility.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaStrictAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaStrictCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaTotal.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)
boolean	RaVoidPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument,DungTheory>> ev)

Uses of DungTheory in org.tweetyproject.arg.rankings.reasoner

Classes in org.tweetyproject.arg.rankings.reasoner with type parameters of type DungTheory

Modifier and Type	Class	Description
class	AbstractRankingReasoner<R extends GeneralComparator<Argument,DungTheory>>	Common abstract class for ranking reasoners for abstract argumentation.

Subclasses with type arguments of type DungTheory in org.tweetyproject.arg.rankings.reasoner

Modifier and Type	Class	Description
class	BurdenBasedRankingReasoner	This class implements the "Burden-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.
class	CategorizerRankingReasoner	This class implements the "h-categorizer" argument ranking approach that was originally proposed by [Besnard, Hunter.
class	CounterTransitivityReasoner	This class implements the argument ranking approach of [Pu, Luo, Ranking Arguments based on Counter-Transitivity 2017].
class	CountingRankingReasoner	This class implements the argument ranking approach of [Pu, Zhang, G.Luo, J.Luo.
class	DiscussionBasedRankingReasoner	This class implements the "Discussion-based" argument semantics approach as proposed by [Amgoud, Ben-Naim.
class	IteratedGradedDefenseReasoner	This class implements the argument ranking approach of [Grossi, Modgil.
class	ProbabilisticRankingReasoner	Implements a graded semantics reasoner based on the ideas from [Thimm, Cerutti, Rienstra.
class	PropagationRankingReasoner	This class implements the argument ranking approach of [Delobelle.
class	SAFRankingReasoner	This class implements the social abstract argumentation approach as proposed by [Bonzon, Delobelle, Konieczny, Maudet.
class	SerialisableRankingReasoner	Implements the serialisable ranking semantics from [Blümel, Thimm.
class	StrategyBasedRankingReasoner	This class implements the argument ranking approach of [Matt, Toni.
class	TuplesRankingReasoner	This class implements the "tuples*" argument ranking approach as proposed by [Cayrol, Lagasquie-Schiex.

Classes in org.tweetyproject.arg.rankings.reasoner that implement interfaces with type arguments of type DungTheory

Modifier and Type	Class	Description
class	AbstractRankingReasoner<R extends GeneralComparator<Argument,DungTheory>>	Common abstract class for ranking reasoners for abstract argumentation.

Methods in org.tweetyproject.arg.rankings.reasoner that return types with arguments of type DungTheory

Modifier and Type	Method	Description
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.cardinality(DungTheory af)	orders arguments after the amount of attackers they have.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the cardinality function.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNCompleteExtensions(DungTheory theory, int m, int n)	Returns all mn-complete extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNGroundedExtensions(DungTheory theory, int m, int n)	Returns all mn-grounded extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNPreferredExtensions(DungTheory theory, int m, int n)	Returns all mn-preferred extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMStableExtensions(DungTheory theory, int m)	Returns all m-stable extensions.
LatticePartialOrder<Argument,DungTheory>	BurdenBasedRankingReasoner.getModel(DungTheory base)
NumericalPartialOrder<Argument,DungTheory>	CategorizerRankingReasoner.getModel(DungTheory base)
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	CountingRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	DiscussionBasedRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	IteratedGradedDefenseReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	ProbabilisticRankingReasoner.getModel(DungTheory aaf)
LatticePartialOrder<Argument,DungTheory>	PropagationRankingReasoner.getModel(DungTheory kb)
NumericalPartialOrder<Argument,DungTheory>	SAFRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	SerialisableRankingReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	StrategyBasedRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	TuplesRankingReasoner.getModel(DungTheory kb)
Collection<LatticePartialOrder<Argument,DungTheory>>	BurdenBasedRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	CategorizerRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	CounterTransitivityReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	CountingRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	DiscussionBasedRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	IteratedGradedDefenseReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	ProbabilisticRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	PropagationRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	SAFRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	SerialisableRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	StrategyBasedRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	TuplesRankingReasoner.getModels(DungTheory bbase)
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.gfpCardinality(DungTheory af)	calculates the greatest fix point.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to a given ranking.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the quality function.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	only ranks two arguments if one is better according to quality and cardinality

Methods in org.tweetyproject.arg.rankings.reasoner with parameters of type DungTheory

Modifier and Type	Method	Description
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.cardinality(DungTheory af)	orders arguments after the amount of attackers they have.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the cardinality function.
double	StrategyBasedRankingReasoner.computeDegreeOfAcceptability(Collection<Argument> A, Collection<Argument> B, DungTheory kb)	Computes the degree of acceptability of the strategy A wrt.
double	StrategyBasedRankingReasoner.computeRewards(Collection<Argument> A, Collection<Argument> B, DungTheory kb)	Computes the rewards of the given strategy (set of arguments).
double	StrategyBasedRankingReasoner.computeStrengthOfArgument(Argument a, DungTheory kb, Set<Set<Argument>> subsets)	Computes the value of the zero-sum game for the given argument.
Pair<int[],int[]>	TuplesRankingReasoner.computeTupledValue(Argument a, DungTheory kb)	Computes the tupled value for the given argument.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNCompleteExtensions(DungTheory theory, int m, int n)	Returns all mn-complete extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNGroundedExtensions(DungTheory theory, int m, int n)	Returns all mn-grounded extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMNPreferredExtensions(DungTheory theory, int m, int n)	Returns all mn-preferred extensions.
Collection<Extension<DungTheory>>	IteratedGradedDefenseReasoner.getAllMStableExtensions(DungTheory theory, int m)	Returns all m-stable extensions.
LatticePartialOrder<Argument,DungTheory>	BurdenBasedRankingReasoner.getModel(DungTheory base)
NumericalPartialOrder<Argument,DungTheory>	CategorizerRankingReasoner.getModel(DungTheory base)
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	CountingRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	DiscussionBasedRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	IteratedGradedDefenseReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	ProbabilisticRankingReasoner.getModel(DungTheory aaf)
LatticePartialOrder<Argument,DungTheory>	PropagationRankingReasoner.getModel(DungTheory kb)
NumericalPartialOrder<Argument,DungTheory>	SAFRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	SerialisableRankingReasoner.getModel(DungTheory bbase)
NumericalPartialOrder<Argument,DungTheory>	StrategyBasedRankingReasoner.getModel(DungTheory kb)
LatticePartialOrder<Argument,DungTheory>	TuplesRankingReasoner.getModel(DungTheory kb)
Collection<LatticePartialOrder<Argument,DungTheory>>	BurdenBasedRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	CategorizerRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	CounterTransitivityReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	CountingRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	DiscussionBasedRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	IteratedGradedDefenseReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	ProbabilisticRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	PropagationRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	SAFRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	SerialisableRankingReasoner.getModels(DungTheory bbase)
Collection<NumericalPartialOrder<Argument,DungTheory>>	StrategyBasedRankingReasoner.getModels(DungTheory bbase)
Collection<LatticePartialOrder<Argument,DungTheory>>	TuplesRankingReasoner.getModels(DungTheory bbase)
int	DiscussionBasedRankingReasoner.getNumberOfPathsOfLength(DungTheory base, Argument a, int i)	Returns the number of linear discussions of the given length in the given DungTheory for the given argument.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.gfpCardinality(DungTheory af)	calculates the greatest fix point.
Collection<Argument>	IteratedGradedDefenseReasoner.gradedDefense(DungTheory theory, Collection<Argument> args, int m, int n)	Implements the graded defense function from Def.
Collection<Argument>	IteratedGradedDefenseReasoner.gradedNeutrality(DungTheory theory, Collection<Argument> args, int m)	Implements the graded neutrality function from Def.
boolean	IteratedGradedDefenseReasoner.isMConflictFree(DungTheory theory, Collection<Argument> args, int m)	Checks whether the given set of arguments is m-conflict-free, cf.
boolean	IteratedGradedDefenseReasoner.isMNAdmissible(DungTheory theory, Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-admissible, cf.
boolean	IteratedGradedDefenseReasoner.isMNComplete(DungTheory theory, Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-complete, cf.
boolean	IteratedGradedDefenseReasoner.isMNGrounded(DungTheory theory, Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-grounded, cf.
boolean	IteratedGradedDefenseReasoner.isMNPreferred(DungTheory theory, Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-preferred, cf.
boolean	IteratedGradedDefenseReasoner.isMStable(DungTheory theory, Collection<Argument> args, int m)	Checks whether the given set of arguments is m-stable, cf.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to a given ranking.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the quality function.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	only ranks two arguments if one is better according to quality and cardinality

Method parameters in org.tweetyproject.arg.rankings.reasoner with type arguments of type DungTheory

Modifier and Type	Method	Description
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the cardinality function.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to a given ranking.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	ranks arguments according to the quality function.
LatticePartialOrder<Argument,DungTheory>	CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument,DungTheory> ra)	only ranks two arguments if one is better according to quality and cardinality

Constructor parameters in org.tweetyproject.arg.rankings.reasoner with type arguments of type DungTheory

Modifier	Constructor	Description
	CounterTransitivityReasoner(CounterTransitivityReasoner.solver sol, LatticePartialOrder<Argument,DungTheory> rank)	Constructor

Uses of DungTheory in org.tweetyproject.arg.rankings.util

Methods in org.tweetyproject.arg.rankings.util that return types with arguments of type DungTheory

Modifier and Type	Method	Description
static GeneralComparator<Argument,DungTheory>	RankingTools.roundRanking(NumericalPartialOrder<Argument,DungTheory> ranking, int n)	Rounds values in the given numerical argument ranking to n decimals.

Methods in org.tweetyproject.arg.rankings.util with parameters of type DungTheory

Modifier and Type	Method	Description
static HashSet<ArrayList<Argument>>	RankingTools.getPathsOfHigherSize(HashSet<ArrayList<Argument>> oldPaths, DungTheory base)	Given a set of argument paths of length i-1, this method returns a set of argument paths of length i for the given DungTheory.

Method parameters in org.tweetyproject.arg.rankings.util with type arguments of type DungTheory

Modifier and Type	Method	Description
static GeneralComparator<Argument,DungTheory>	RankingTools.roundRanking(NumericalPartialOrder<Argument,DungTheory> ranking, int n)	Rounds values in the given numerical argument ranking to n decimals.

Uses of DungTheory in org.tweetyproject.arg.saf.syntax

Subclasses of DungTheory in org.tweetyproject.arg.saf.syntax

Modifier and Type	Class	Description
class	StructuredArgumentationFramework	This class represents a structured argumentation framework, i.e.

Methods in org.tweetyproject.arg.saf.syntax that return DungTheory

Modifier and Type	Method	Description
DungTheory	StructuredArgumentationFramework.toDungTheory()	Constructs a (pure) Dung theory from this structured argumentation framework.

Uses of DungTheory in org.tweetyproject.arg.social.syntax

Subclasses of DungTheory in org.tweetyproject.arg.social.syntax

Modifier and Type	Class	Description
class	SocialAbstractArgumentationFramework	This class implements a social abstract argumentation framework from [Joao Leite, Joao Martins.

Methods in org.tweetyproject.arg.social.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	SocialAbstractArgumentationFramework.add(DungTheory theory)

Uses of DungTheory in org.tweetyproject.arg.weighted.reasoner

Methods in org.tweetyproject.arg.weighted.reasoner that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	SimpleWeightedAdmissibleReasoner.getModel(DungTheory bbase, T alpha, T gamma)	Returns the empty set as it is always admissible.
Extension<DungTheory>	SimpleWeightedCompleteReasoner.getModel(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Returns an alpha-gamma-complete extension for the given weighted argumentation framework.
Extension<DungTheory>	SimpleWeightedConflictFreeReasoner.getModel(WeightedArgumentationFramework<T> bbase, T alpha)	Returns the empty set as it is always conflict-free.
Extension<DungTheory>	SimpleWeightedGroundedReasoner.getModel(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes and returns the unique alpha-gamma-grounded extension for the given weighted argumentation framework.
Extension<DungTheory>	SimpleWeightedPreferredReasoner.getModel(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes and returns a single alpha-gamma-preferred extension for the given weighted argumentation framework.
Extension<DungTheory>	SimpleWeightedStableReasoner.getModel(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes and returns a single alpha-gamma-stable extension for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedAdmissibleReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes all alpha-gamma-admissible extensions for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedCompleteReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes all alpha-gamma-complete extensions for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedConflictFreeReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha)	Computes all alpha-conflict-free extensions for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedGroundedReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes and returns a collection containing the unique alpha-gamma-grounded extension for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedPreferredReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes all alpha-gamma-preferred extensions for the given weighted argumentation framework.
Collection<Extension<DungTheory>>	SimpleWeightedStableReasoner.getModels(WeightedArgumentationFramework<T> bbase, T alpha, T gamma)	Computes all alpha-gamma-stable extensions for the given weighted argumentation framework.

Methods in org.tweetyproject.arg.weighted.reasoner with parameters of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	SimpleWeightedAdmissibleReasoner.getModel(DungTheory bbase, T alpha, T gamma)	Returns the empty set as it is always admissible.

Uses of DungTheory in org.tweetyproject.arg.weighted.syntax

Subclasses of DungTheory in org.tweetyproject.arg.weighted.syntax

Modifier and Type	Class	Description
class	WeightedArgumentationFramework<T>	This class implements a weighted abstract argumentation theory (WAF) using a C-Semiring.

Methods in org.tweetyproject.arg.weighted.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	WeightedArgumentationFramework.add(DungTheory theory)	Adds all arguments and attacks of the given theory to this theory.

Method parameters in org.tweetyproject.arg.weighted.syntax with type arguments of type DungTheory

Modifier and Type	Method	Description
boolean	WeightedArgumentationFramework.gDefence(T gamma, Extension<DungTheory> e)	Determines if the given extension can defend itself from all attacks up to a specified threshold gamma.
boolean	WeightedArgumentationFramework.gDefence(T gamma, Extension<DungTheory> e, Set<Argument> attackers)	Determines if the given extension can defend itself from a set of attackers up to a specified threshold gamma.
boolean	WeightedArgumentationFramework.gDefence(T gamma, Extension<DungTheory> e, Set<Argument> attackers, Set<Argument> attacked)	Determines if the given extension can defend itself and specific arguments from a set of attackers up to a specified threshold gamma.
boolean	WeightedArgumentationFramework.gDefence(T gamma, Argument a, Extension<DungTheory> e)	Determines if the given extension can defend itself and argument a from all attacks up to a specified threshold gamma.
boolean	WeightedArgumentationFramework.isAcceptable(Argument argument, Extension<DungTheory> ext)	returns true if every attacker on argument is successfully attacked by some accepted argument wrt.
boolean	WeightedArgumentationFramework.isAlphaConflictFree(T alpha, Extension<DungTheory> ext)	Determines if the given extension is alpha-conflict-free.
boolean	WeightedArgumentationFramework.isAlphaGammaAdmissible(T alpha, T gamma, Extension<DungTheory> ext)	Determines if the given extension is both alpha-conflict-free and gamma-defensible.
boolean	WeightedArgumentationFramework.isAlphaGammaComplete(T alpha, T gamma, Extension<DungTheory> ext)	Determines if the given extension is both alpha-gamma-complete.
boolean	WeightedArgumentationFramework.isAlphaGammaPreferred(T alpha, T gamma, Extension<DungTheory> ext)	Determines if the given extension is alpha-gamma-preferred.
boolean	WeightedArgumentationFramework.isAlphaGammaStable(T alpha, T gamma, Extension<DungTheory> ext)	Determines if the given extension is alpha-gamma-stable.
boolean	WeightedArgumentationFramework.isAttacked(Extension<DungTheory> ext1, Extension<DungTheory> ext2)	returns true if some argument of ext2 attacks some argument in ext1 and ext1 cannot w-defend itself
boolean	WeightedArgumentationFramework.isSMA(Extension<DungTheory> attacker, Extension<DungTheory> attacked)	Determines whether the given attacker Extension is a set-maximal attack on the attacked Extension.
boolean	WeightedArgumentationFramework.wDefence(Extension<DungTheory> e)	Determines if the given extension can defend itself from all attacks.
boolean	WeightedArgumentationFramework.wDefence(Extension<DungTheory> e, Set<Argument> attackers)	Determines if the given extension can defend itself from a set of attackers.
boolean	WeightedArgumentationFramework.wDefence(Extension<DungTheory> e, Set<Argument> attackers, Set<Argument> attacked)	Determines if the given extension can defend itself and specific arguments from a set of attackers.
boolean	WeightedArgumentationFramework.wDefence(Argument a, Extension<DungTheory> e)	Determines if the given extension can defend a specific argument from all attacks.

Uses of DungTheory in org.tweetyproject.web.services

Methods in org.tweetyproject.web.services that return DungTheory

Modifier and Type	Method	Description
static DungTheory	Utils.getDungTheory(int nr_of_arguments, List<List<Integer>> atttacks)	Creates a DungTheory from the given number of arguments and attack relations.

Uses of DungTheory in org.tweetyproject.web.services.dung

Methods in org.tweetyproject.web.services.dung that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Extension<DungTheory>	DungReasonerGetModelCallee.call()	Executes the getModel operation using the specified reasoner and base DungTheory.
Collection<Extension<DungTheory>>	DungReasonerGetModelsCallee.call()	Executes the getModels operation using the specified reasoner and base DungTheory.

Methods in org.tweetyproject.web.services.dung with parameters of type DungTheory

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

Constructors in org.tweetyproject.web.services.dung with parameters of type DungTheory

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