Uses of Class
net.sf.tweety.arg.dung.syntax.Argument

Packages that use Argument

Package	Description
net.sf.tweety.agents.dialogues
net.sf.tweety.agents.dialogues.oppmodels
net.sf.tweety.arg.aba.semantics
net.sf.tweety.arg.aba.syntax
net.sf.tweety.arg.aspic.syntax
net.sf.tweety.arg.bipolar.syntax
net.sf.tweety.arg.deductive.syntax
net.sf.tweety.arg.dung.ldo.syntax
net.sf.tweety.arg.dung.learning
net.sf.tweety.arg.dung.parser
net.sf.tweety.arg.dung.reasoner
net.sf.tweety.arg.dung.semantics
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.dung.util
net.sf.tweety.arg.dung.writer
net.sf.tweety.arg.prob.lotteries
net.sf.tweety.arg.prob.reasoner
net.sf.tweety.arg.prob.semantics
net.sf.tweety.arg.prob.syntax
net.sf.tweety.arg.rankings.postulates
net.sf.tweety.arg.rankings.reasoner
net.sf.tweety.arg.rankings.semantics
net.sf.tweety.arg.rankings.util
net.sf.tweety.arg.saf.syntax
net.sf.tweety.arg.social.reasoner
net.sf.tweety.arg.social.semantics
net.sf.tweety.arg.social.syntax

Uses of Argument in net.sf.tweety.agents.dialogues

Methods in net.sf.tweety.agents.dialogues that return types with arguments of type Argument

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

Constructor parameters in net.sf.tweety.agents.dialogues with type arguments of type Argument

Constructor	Description
ExecutableExtension(java.util.Collection<? extends Argument> arguments)	Creates a new extension for the given arguments.

Uses of Argument in net.sf.tweety.agents.dialogues.oppmodels

Methods in net.sf.tweety.agents.dialogues.oppmodels that return Argument

Modifier and Type	Method	Description
Argument	RecognitionFunction.getPreimage(Argument a)	Returns the argument which maps to the set containing the given argument.

Methods in net.sf.tweety.agents.dialogues.oppmodels with parameters of type Argument

Modifier and Type	Method	Description
Argument	RecognitionFunction.getPreimage(Argument a)	Returns the argument which maps to the set containing the given argument.

Method parameters in net.sf.tweety.agents.dialogues.oppmodels with type arguments of type Argument

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

Constructors in net.sf.tweety.agents.dialogues.oppmodels with parameters of type Argument

Constructor	Description
GroundedGameUtilityFunction(DungTheory theory, Argument argument, GroundedGameSystem.AgentFaction faction)	Construct utility function.

Constructor parameters in net.sf.tweety.agents.dialogues.oppmodels with type arguments of type Argument

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

Uses of Argument in net.sf.tweety.arg.aba.semantics

Constructors in net.sf.tweety.arg.aba.semantics with parameters of type Argument

Constructor	Description
AbaAttack(Argument attacker, Argument attacked)	Creates a new ABA attack

Uses of Argument in net.sf.tweety.arg.aba.syntax

Subclasses of Argument in net.sf.tweety.arg.aba.syntax

Modifier and Type	Class	Description
class	Deduction<T extends Formula>	An argument derived from an ABA theory.

Uses of Argument in net.sf.tweety.arg.aspic.syntax

Subclasses of Argument in net.sf.tweety.arg.aspic.syntax

Modifier and Type	Class	Description
class	AspicArgument<T extends Invertable>

Uses of Argument in net.sf.tweety.arg.bipolar.syntax

Subclasses of Argument in net.sf.tweety.arg.bipolar.syntax

Modifier and Type	Class	Description
class	BArgument	This class models an argument used by bipolar abstract argumentation theories.

Methods in net.sf.tweety.arg.bipolar.syntax with parameters of type Argument

Modifier and Type	Method	Description
boolean	AbstractBipolarFramework.add(Argument argument)	Adds argument to this argumentation framework for better compatibility between dung theories and bipolar argumentation frameworks

Constructors in net.sf.tweety.arg.bipolar.syntax with parameters of type Argument

Constructor	Description
BArgument(Argument arg)

Uses of Argument in net.sf.tweety.arg.deductive.syntax

Subclasses of Argument in net.sf.tweety.arg.deductive.syntax

Modifier and Type	Class	Description
class	SimplePlLogicArgument

Uses of Argument in net.sf.tweety.arg.dung.ldo.syntax

Methods in net.sf.tweety.arg.dung.ldo.syntax that return Argument

Modifier and Type	Method	Description
Argument	LdoArgument.getArgument()	Returns an argument representation (in Dung-style) of this LdoArgument.

Uses of Argument in net.sf.tweety.arg.dung.learning

Constructor parameters in net.sf.tweety.arg.dung.learning with type arguments of type Argument

Constructor	Description
ImprovedRiveretTheoryLearner(java.util.Collection<Argument> arguments, int max_cycles)	initialize learner for the given set of arguments
RiveretTheoryLearner(java.util.Collection<Argument> arguments)	initialize learner for the given set of arguments

Uses of Argument in net.sf.tweety.arg.dung.parser

Methods in net.sf.tweety.arg.dung.parser that return types with arguments of type Argument

Modifier and Type	Method	Description
static java.util.Collection<java.util.Collection<Argument>>	AbstractDungParser.parseExtensionList(java.lang.String s)	Returns a collection view of the given set of extensions (=sets of arguments)

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

Methods in net.sf.tweety.arg.dung.reasoner that return types with arguments of type Argument

Modifier and Type	Method	Description
abstract java.util.Collection<Argument>	AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)	Returns the set of acceptable arguments of this reasoner.
java.util.Collection<Argument>	EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>	IaqAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>	SeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>	SeemAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, java.util.Collection<Argument> ext)	computes all conflict-free sets, which attack any argument in ext
java.util.Set<Argument>	WeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)	finds the set of arguments S = {a | there exists an edge between a and argument}
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeCandidateSets(DungTheory bbase, java.util.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
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, java.util.Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates
java.util.Collection<Argument>	OrderingSemanticsReasoner.getConflicts(Extension ext, DungTheory theory)	computes the set of conflicts occurring inside ext
java.util.Collection<Argument>	OrderingSemanticsReasoner.getDefendedNotIn(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
java.util.Collection<Argument>	OrderingSemanticsReasoner.getEmpty(Extension ext, DungTheory theory)	dummy method used if only one ordering semantics is specified
java.util.Collection<Argument>	OrderingSemanticsReasoner.getUnattacked(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
java.util.Collection<Argument>	OrderingSemanticsReasoner.getUndefended(Extension ext, DungTheory theory)	computes the set of arguments in ext, which are not defended by ext against outside attackers

Methods in net.sf.tweety.arg.dung.reasoner with parameters of type Argument

Modifier and Type	Method	Description
java.util.Set<Argument>	WeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)	finds the set of arguments S = {a | there exists an edge between a and argument}
java.lang.Boolean	AbstractAcceptabilityReasoner.query(DungTheory beliefbase, Argument formula)
abstract java.lang.Boolean	AbstractDungReasoner.query(DungTheory beliefbase, Argument formula)
java.lang.Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula)
java.lang.Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
java.lang.Boolean	ProboReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
java.lang.Boolean	SatCompleteReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
java.lang.Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula)
java.lang.Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.

Method parameters in net.sf.tweety.arg.dung.reasoner with type arguments of type Argument

Modifier and Type	Method	Description
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, java.util.Collection<Argument> ext)	computes all conflict-free sets, which attack any argument in ext
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeCandidateSets(DungTheory bbase, java.util.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
java.util.Set<java.util.Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, java.util.Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates
java.util.Collection<Extension>	NaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, java.util.Collection<Argument> candidates)	computes all maximal conflict-free sets of bbase

Uses of Argument in net.sf.tweety.arg.dung.semantics

Methods in net.sf.tweety.arg.dung.semantics that return types with arguments of type Argument

Modifier and Type	Method	Description
java.util.Set<java.util.Map.Entry<Argument,ArgumentStatus>>	Labeling.entrySet()
java.util.Set<java.util.Map.Entry<Argument,java.lang.Integer>>	StratifiedLabeling.entrySet()
java.util.Iterator<Argument>	Extension.iterator()
java.util.Set<Argument>	Labeling.keySet()
java.util.Set<Argument>	StratifiedLabeling.keySet()

Methods in net.sf.tweety.arg.dung.semantics with parameters of type Argument

Modifier and Type	Method	Description
boolean	Extension.add(Argument arg0)
boolean	AbstractArgumentationInterpretation.isAcceptable(Argument argument, DungTheory dungTheory)	returns true if every attacker on argument is attacked by some accepted argument wrt.
ArgumentStatus	Labeling.put(Argument arg0, ArgumentStatus arg1)
java.lang.Integer	StratifiedLabeling.put(Argument arg0, java.lang.Integer arg1)
boolean	AbstractArgumentationInterpretation.satisfies(Argument formula)
boolean	StratifiedLabeling.satisfies(Argument formula)

Method parameters in net.sf.tweety.arg.dung.semantics with type arguments of type Argument

Modifier and Type	Method	Description
boolean	Extension.addAll(java.util.Collection<? extends Argument> arg0)
void	Labeling.putAll(java.util.Map<? extends Argument,? extends ArgumentStatus> arg0)
void	StratifiedLabeling.putAll(java.util.Map<? extends Argument,? extends java.lang.Integer> arg0)

Constructor parameters in net.sf.tweety.arg.dung.semantics with type arguments of type Argument

Constructor	Description
Extension(java.util.Collection<? extends Argument> arguments)	Creates a new extension with the given set of arguments.

Uses of Argument in net.sf.tweety.arg.dung.syntax

Methods in net.sf.tweety.arg.dung.syntax that return Argument

Modifier and Type	Method	Description
Argument	Attack.getAttacked()	returns the attacked argument of this attack relation.
Argument	Attack.getAttacker()	returns the attacking argument of this attack relation.

Methods in net.sf.tweety.arg.dung.syntax that return types with arguments of type Argument

Modifier and Type	Method	Description
java.util.Set<Argument>	DungTheory.getAttacked(Argument argument)	Computes the set {A | (argument,A) in attacks}.
java.util.Set<Argument>	DungTheory.getAttackers(Argument argument)	Computes the set {A | (A,argument) in attacks}.
java.util.Collection<Argument>	DungTheory.getChildren(Node node)
java.util.Collection<Graph<Argument>>	DungTheory.getComponents()
Edge<Argument>	DungTheory.getEdge(Argument a, Argument b)
java.util.Collection<? extends Edge<? extends Argument>>	DungTheory.getEdges()
java.util.Collection<Graph<Argument>>	DungTheory.getInducedSubgraphs()
java.util.Collection<Argument>	DungTheory.getNeighbors(Argument node)
java.util.Collection<Argument>	DungTheory.getNodes()
java.util.Collection<Argument>	DungTheory.getParents(Node node)
Graph<Argument>	DungTheory.getRestriction(java.util.Collection<Argument> arguments)
java.util.Collection<java.util.Collection<Argument>>	DungTheory.getStronglyConnectedComponents()
java.util.Collection<Graph<Argument>>	DungTheory.getSubgraphs()

Methods in net.sf.tweety.arg.dung.syntax with parameters of type Argument

Modifier and Type	Method	Description
boolean	DungTheory.add(Argument argument)
boolean	DungTheory.addAttack(Argument attacker, Argument attacked)	Adds an attack from the first argument to the second to thisDdung theory.
boolean	WeightedDungTheory.addAttack(Argument attacker, Argument attacked)	add attack between both arguments to the theory and set weight to 1
boolean	WeightedDungTheory.addAttack(Argument attacker, Argument attacked, double weight)	add attack between both arguments to the theory and set weight to given value
boolean	DungTheory.areAdjacent(Argument a, Argument b)
boolean	Attack.contains(Argument argument)	Return true if the given argument is in this attack relation.
boolean	DungTheory.existsDirectedPath(Argument node1, Argument node2)
java.util.Set<Argument>	DungTheory.getAttacked(Argument argument)	Computes the set {A | (argument,A) in attacks}.
java.util.Set<Argument>	DungTheory.getAttackers(Argument argument)	Computes the set {A | (A,argument) in attacks}.
Edge<Argument>	DungTheory.getEdge(Argument a, Argument b)
java.util.Collection<Argument>	DungTheory.getNeighbors(Argument node)
java.lang.Double	WeightedDungTheory.getWeight(Argument attacker, Argument attacked)	return weight of the attack between the given arguments
boolean	DungTheory.hasAttackBranch(Argument a)	If this graph is acyclic, this method checks if the given argument has an attack branch, i.e.
boolean	DungTheory.hasDefenseBranch(Argument a)	If this graph is acyclic, this method checks if the given argument has a defense branch, i.e.
boolean	DungTheory.isAttackBranch(Argument a, Argument b)	Checks whether the path from b to a is an attack branch, i.e.
boolean	DungTheory.isAttacked(Argument argument, Extension ext)	returns true if some argument of ext attacks argument.
boolean	DungTheory.isAttackedBy(Argument argument, java.util.Collection<Argument> ext)	returns true if some argument of ext is attacked by argument.
boolean	DungTheory.isAttackedBy(Argument arg1, Argument arg2)	Checks whether arg1 is attacked by arg2.
boolean	DungTheory.isDefenseBranch(Argument a, Argument b)	Checks whether the path from b to a is a defense branch, i.e.
boolean	DungTheory.isIndirectAttack(Argument arg1, Argument arg2)	Checks whether "arg1" indirectly attacks "arg2", i.e.
boolean	DungTheory.isSupport(Argument arg1, Argument arg2)	Checks whether "arg1" supports "arg2", i.e.
boolean	DungTheory.remove(Argument a)	Removes the argument and all its attacks

Method parameters in net.sf.tweety.arg.dung.syntax with type arguments of type Argument

Modifier and Type	Method	Description
boolean	DungTheory.add(Edge<Argument> edge)
Graph<Argument>	DungTheory.getRestriction(java.util.Collection<Argument> arguments)
boolean	DungTheory.isAttackedBy(Argument argument, java.util.Collection<Argument> ext)	returns true if some argument of ext is attacked by argument.
boolean	Attack.isConflictFree(java.util.Collection<? extends Argument> arguments)	returns true if one arguments in arguments attacks another within this attack relation.

Constructors in net.sf.tweety.arg.dung.syntax with parameters of type Argument

Constructor	Description
Attack(Argument attacker, Argument attacked)	Default constructor; initializes the two arguments used in this attack relation
DungSignature(Argument argument)	Creates a new signature with the single given argument.

Constructor parameters in net.sf.tweety.arg.dung.syntax with type arguments of type Argument

Constructor	Description
DungSignature(java.util.Collection<? extends Argument> arguments)	Creates a new signature with the given set of arguments.
DungTheory(Graph<Argument> graph)	Creates a new theory from the given graph.

Uses of Argument in net.sf.tweety.arg.dung.util

Methods in net.sf.tweety.arg.dung.util with parameters of type Argument

Modifier and Type	Method	Description
DungTheory	DefaultDungTheoryGenerator.next(Argument arg)
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(Argument arg)
DungTheory	FileDungTheoryGenerator.next(Argument arg)
DungTheory	IsoSafeEnumeratingDungTheoryGenerator.next(Argument arg)
DungTheory	PodlaszewskiCaminadaDungTheoryGenerator.next(Argument arg)

Uses of Argument in net.sf.tweety.arg.dung.writer

Method parameters in net.sf.tweety.arg.dung.writer with type arguments of type Argument

Modifier and Type	Method	Description
static java.lang.String	AbstractDungWriter.writeArguments(java.util.Collection<Argument> args)	Writes the given collection of arguments into a string of the form [arg1,...,argn].

Uses of Argument in net.sf.tweety.arg.prob.lotteries

Methods in net.sf.tweety.arg.prob.lotteries with parameters of type Argument

Modifier and Type	Method	Description
Probability	SubgraphProbabilityFunction.getAcceptanceProbability(Argument arg, Semantics semantics)	Returns the probability of the given argument being acceptable wrt.
Probability	SubgraphProbabilityFunction.getEpistemicProbability(Argument arg)	Returns the epistemic probability of the given argument, i.e.

Uses of Argument in net.sf.tweety.arg.prob.reasoner

Methods in net.sf.tweety.arg.prob.reasoner with parameters of type Argument

Modifier and Type	Method	Description
java.lang.Double	AbstractPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula)
abstract java.lang.Double	AbstractPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)	Queries the given PAF for the given argument using the given inference type.
java.lang.Double	MonteCarloPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)
java.lang.Double	SimplePafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)

Uses of Argument in net.sf.tweety.arg.prob.semantics

Methods in net.sf.tweety.arg.prob.semantics with parameters of type Argument

Modifier and Type	Method	Description
Probability	ProbabilisticExtension.probability(Argument a)	Computes the probability of the given argument.

Method parameters in net.sf.tweety.arg.prob.semantics with type arguments of type Argument

Modifier and Type	Method	Description
abstract java.util.Collection<Statement>	AbstractPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	CoherentPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	FoundedPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	InvolutaryPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	JustifiablePASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	NeutralPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	OptimisticPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	PASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)	Returns the mathematical statement corresponding to the satisfaction of the given theory wrt.
java.util.Collection<Statement>	RationalPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	SemiFoundedPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
java.util.Collection<Statement>	SemiOptimisticPASemantics.getSatisfactionStatements(DungTheory theory, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)

Uses of Argument in net.sf.tweety.arg.prob.syntax

Methods in net.sf.tweety.arg.prob.syntax with parameters of type Argument

Modifier and Type	Method	Description
boolean	ProbabilisticArgumentationFramework.add(Argument a)
boolean	ProbabilisticArgumentationFramework.add(Argument a, Probability p)	Adds the given argument with the given probability
Probability	ProbabilisticArgumentationFramework.getProbability(Argument a)	Returns the probability of the given argument.
boolean	ProbabilisticArgumentationFramework.remove(Argument a)

Constructor parameters in net.sf.tweety.arg.prob.syntax with type arguments of type Argument

Constructor	Description
ProbabilisticArgumentationFramework(Graph<Argument> graph)	Creates a new PAF from the given graph, all arguments and attacks have probability 1.

Uses of Argument in net.sf.tweety.arg.rankings.postulates

Method parameters in net.sf.tweety.arg.rankings.postulates with type arguments of type Argument

Modifier and Type	Method	Description
boolean	RaAbstraction.isApplicable(java.util.Collection<Argument> kb)
boolean	RaAdditionOfAttackBranch.isApplicable(java.util.Collection<Argument> kb)
boolean	RaAdditionOfDefenseBranch.isApplicable(java.util.Collection<Argument> kb)
boolean	RaAttackVsFullDefense.isApplicable(java.util.Collection<Argument> kb)
boolean	RaCardinalityPrecedence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaCounterTransitivity.isApplicable(java.util.Collection<Argument> kb)
boolean	RaDefensePrecedence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaDistDefensePrecedence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaIncreaseOfAttackBranch.isApplicable(java.util.Collection<Argument> kb)
boolean	RaIncreaseOfDefenseBranch.isApplicable(java.util.Collection<Argument> kb)
boolean	RaIndependence.isApplicable(java.util.Collection<Argument> kb)
abstract boolean	RankingPostulate.isApplicable(java.util.Collection<Argument> kb)
boolean	RaNonAttackedEquivalence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaQualityPrecedence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaSelfContradiction.isApplicable(java.util.Collection<Argument> kb)
boolean	RaStrictAdditionOfDefenseBranch.isApplicable(java.util.Collection<Argument> kb)
boolean	RaStrictCounterTransitivity.isApplicable(java.util.Collection<Argument> kb)
boolean	RaTotal.isApplicable(java.util.Collection<Argument> kb)
boolean	RaVoidPrecedence.isApplicable(java.util.Collection<Argument> kb)
boolean	RaAbstraction.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaAdditionOfAttackBranch.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaAdditionOfDefenseBranch.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaAttackVsFullDefense.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaCardinalityPrecedence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaCounterTransitivity.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaDefensePrecedence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaDistDefensePrecedence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaIncreaseOfAttackBranch.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaIncreaseOfDefenseBranch.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaIndependence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
abstract boolean	RankingPostulate.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RankingPostulate.isSatisfied(java.util.Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean	RankingPostulate.isSatisfied(java.util.Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean	RaNonAttackedEquivalence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaQualityPrecedence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaSelfContradiction.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaStrictAdditionOfDefenseBranch.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaStrictCounterTransitivity.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaTotal.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean	RaVoidPrecedence.isSatisfied(java.util.Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)

Uses of Argument in net.sf.tweety.arg.rankings.reasoner

Methods in net.sf.tweety.arg.rankings.reasoner that return types with arguments of type Argument

Modifier and Type	Method	Description
java.util.Map<Argument,Pair<int[],int[]>>	TuplesRankingReasoner.getTupledValues()
java.util.Collection<Argument>	IteratedGradedDefenseReasoner.gradedDefense(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Implements the graded defense function from Def.
java.util.Collection<Argument>	IteratedGradedDefenseReasoner.gradedNeutrality(DungTheory theory, java.util.Collection<Argument> args, int m)	Implements the graded neutrality function from Def.

Methods in net.sf.tweety.arg.rankings.reasoner with parameters of type Argument

Modifier and Type	Method	Description
double	MTRankingReasoner.computeStrengthOfArgument(Argument a, DungTheory kb, java.util.Set<java.util.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.
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.

Method parameters in net.sf.tweety.arg.rankings.reasoner with type arguments of type Argument

Modifier and Type	Method	Description
double	MTRankingReasoner.computeDegreeOfAcceptability(java.util.Collection<Argument> A, java.util.Collection<Argument> B, DungTheory kb)	Computes the degree of acceptability of the strategy A wrt.
double	MTRankingReasoner.computeRewards(java.util.Collection<Argument> A, java.util.Collection<Argument> B, DungTheory kb)	Computes the rewards of the given strategy (set of arguments).
double	MTRankingReasoner.computeStrengthOfArgument(Argument a, DungTheory kb, java.util.Set<java.util.Set<Argument>> subsets)	Computes the value of the zero-sum game for the given argument.
java.util.Collection<Argument>	IteratedGradedDefenseReasoner.gradedDefense(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Implements the graded defense function from Def.
java.util.Collection<Argument>	IteratedGradedDefenseReasoner.gradedNeutrality(DungTheory theory, java.util.Collection<Argument> args, int m)	Implements the graded neutrality function from Def.
boolean	IteratedGradedDefenseReasoner.isMConflictFree(DungTheory theory, java.util.Collection<Argument> args, int m)	Checks whether the given set of arguments is m-conflict-free, cf.
boolean	IteratedGradedDefenseReasoner.isMNAdmissible(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-admissible, cf.
boolean	IteratedGradedDefenseReasoner.isMNComplete(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-complete, cf.
boolean	IteratedGradedDefenseReasoner.isMNGrounded(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-grounded, cf.
boolean	IteratedGradedDefenseReasoner.isMNPreferred(DungTheory theory, java.util.Collection<Argument> args, int m, int n)	Checks whether the given set of arguments is mn-preferred, cf.
boolean	IteratedGradedDefenseReasoner.isMStable(DungTheory theory, java.util.Collection<Argument> args, int m)	Checks whether the given set of arguments is m-stable, cf.

Uses of Argument in net.sf.tweety.arg.rankings.semantics

Methods in net.sf.tweety.arg.rankings.semantics that return types with arguments of type Argument

Modifier and Type	Method	Description
java.util.Set<java.util.Map.Entry<Argument,java.lang.Double>>	NumericalArgumentRanking.entrySet()
java.util.Collection<Argument>	ArgumentRanking.getMaximallyAcceptedArguments(java.util.Collection<Argument> args)	Returns the set of all arguments a from the given set that are maximally accepted, i.e.
java.util.Collection<Argument>	ArgumentRanking.getMinimallyAcceptedArguments(java.util.Collection<Argument> args)	Returns the set of all arguments a from the given set that are minimally accepted, i.e.
java.util.Set<Argument>	NumericalArgumentRanking.keySet()

Methods in net.sf.tweety.arg.rankings.semantics with parameters of type Argument

Modifier and Type	Method	Description
int	ArgumentRanking.compare(Argument arg0, Argument arg1)
boolean	ArgumentRanking.isEquallyAcceptableThan(Argument a, Argument b)	Returns "true" iff a is equally acceptable as b, i.e.
abstract boolean	ArgumentRanking.isIncomparable(Argument a, Argument b)	Returns "true" iff a and b are incomparable (i.e.
boolean	LatticeArgumentRanking.isIncomparable(Argument a, Argument b)
boolean	NumericalArgumentRanking.isIncomparable(Argument a, Argument b)
boolean	ArgumentRanking.isStrictlyLessAcceptableThan(Argument a, Argument b)	Returns "true" iff a is strictly less acceptable than b, i.e.
abstract boolean	ArgumentRanking.isStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)	Returns "true" iff a is strictly less acceptable than b or a is equally acceptable as b or a and b are not comparable, i.e.
boolean	LatticeArgumentRanking.isStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)
boolean	NumericalArgumentRanking.isStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)
boolean	ArgumentRanking.isStrictlyMoreAcceptableThan(Argument a, Argument b)	Returns "true" iff a is strictly more acceptable than b, i.e.
boolean	ArgumentRanking.isStrictlyMoreOrEquallyAcceptableThan(Argument a, Argument b)	Returns "true" iff a is strictly more acceptable than b or a is equally acceptable as b, i.e.
java.lang.Double	NumericalArgumentRanking.put(Argument arg0, java.lang.Double arg1)
void	LatticeArgumentRanking.setStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)	Defines "a" to be strictly less or equally acceptable than "b".

Method parameters in net.sf.tweety.arg.rankings.semantics with type arguments of type Argument

Modifier and Type	Method	Description
java.util.Collection<Argument>	ArgumentRanking.getMaximallyAcceptedArguments(java.util.Collection<Argument> args)	Returns the set of all arguments a from the given set that are maximally accepted, i.e.
java.util.Collection<Argument>	ArgumentRanking.getMinimallyAcceptedArguments(java.util.Collection<Argument> args)	Returns the set of all arguments a from the given set that are minimally accepted, i.e.
boolean	ArgumentRanking.isEquivalent(ArgumentRanking other, java.util.Collection<Argument> args)	Checks whether this ranking is equivalent to the other one wrt.
void	NumericalArgumentRanking.putAll(java.util.Map<? extends Argument,? extends java.lang.Double> arg0)

Constructor parameters in net.sf.tweety.arg.rankings.semantics with type arguments of type Argument

Constructor	Description
LatticeArgumentRanking(java.util.Collection<Argument> args)	Creates a new argument ranking with the given arguments which are initially all incomparable.
NumericalArgumentRanking(java.util.Collection<Argument> args, double initialvalue)	Creates a new argument ranking.

Uses of Argument in net.sf.tweety.arg.rankings.util

Methods in net.sf.tweety.arg.rankings.util that return types with arguments of type Argument

Modifier and Type	Method	Description
static java.util.HashSet<java.util.ArrayList<Argument>>	RankingTools.getPathsOfHigherSize(java.util.HashSet<java.util.ArrayList<Argument>> old_paths, 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 net.sf.tweety.arg.rankings.util with type arguments of type Argument

Modifier and Type	Method	Description
static java.util.HashSet<java.util.ArrayList<Argument>>	RankingTools.getPathsOfHigherSize(java.util.HashSet<java.util.ArrayList<Argument>> old_paths, 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.

Uses of Argument in net.sf.tweety.arg.saf.syntax

Subclasses of Argument in net.sf.tweety.arg.saf.syntax

Modifier and Type	Class	Description
class	ArgumentStructure	This class models an argument structure, i.e.
class	BasicArgument	This class models a basic argument in structured argumentation frameworks, i.e.

Methods in net.sf.tweety.arg.saf.syntax with parameters of type Argument

Modifier and Type	Method	Description
boolean	StructuredArgumentationFramework.isAttackedBy(Argument arg1, Argument arg2)

Uses of Argument in net.sf.tweety.arg.social.reasoner

Methods in net.sf.tweety.arg.social.reasoner with parameters of type Argument

Modifier and Type	Method	Description
java.lang.Double	IssReasoner.query(SocialAbstractArgumentationFramework beliefbase, Argument formula)

Uses of Argument in net.sf.tweety.arg.social.semantics

Methods in net.sf.tweety.arg.social.semantics with parameters of type Argument

Modifier and Type	Method	Description
boolean	SocialMapping.containsKey(Argument a)	Returns "true" iff the given argument has a value.
L	SocialMapping.get(Argument a)	Returns the social value of the given argument
L	SocialMapping.put(Argument a, L val)	Sets the social value of the given argument
boolean	SocialMapping.satisfies(Argument formula)

Uses of Argument in net.sf.tweety.arg.social.syntax

Methods in net.sf.tweety.arg.social.syntax with parameters of type Argument

Modifier and Type	Method	Description
boolean	SocialAbstractArgumentationFramework.add(Argument a)
int	SocialAbstractArgumentationFramework.getNegative(Argument arg)	Returns the number of negative votes of the given argument
int	SocialAbstractArgumentationFramework.getPositive(Argument arg)	Returns the number of positive votes of the given argument
boolean	SocialAbstractArgumentationFramework.remove(Argument a)
void	SocialAbstractArgumentationFramework.voteDown(Argument arg)	Adds a negative vote to the given argument.
void	SocialAbstractArgumentationFramework.voteDown(Argument arg, int number)	Adds the given number of negative votes to the given argument
void	SocialAbstractArgumentationFramework.voteUp(Argument arg)	Adds a positive vote to the given argument.
void	SocialAbstractArgumentationFramework.voteUp(Argument arg, int number)	Adds the given number of positive votes to the given argument

Constructor parameters in net.sf.tweety.arg.social.syntax with type arguments of type Argument

Constructor	Description
SocialAbstractArgumentationFramework(Graph<Argument> graph)	Creates a new social abstract argumentation framework from the given graph.