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

Packages that use Argument

Package	Description
net.sf.tweety.arg.dung
net.sf.tweety.arg.dung.ldo.syntax
net.sf.tweety.arg.dung.parser
net.sf.tweety.arg.dung.prover
net.sf.tweety.arg.dung.semantics
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.dung.util
net.sf.tweety.arg.dung.writer

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

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

Modifier and Type	Method and Description
Set<Argument>	DungTheory.getAttacked(Argument argument) Computes the set {A | (argument,A) in attacks}.
Set<Argument>	DungTheory.getAttackers(Argument argument) Computes the set {A | (A,argument) in attacks}.
Collection<Argument>	DungTheory.getChildren(net.sf.tweety.graphs.Node node)
net.sf.tweety.graphs.Edge<Argument>	DungTheory.getEdge(Argument a, Argument b)
Collection<? extends net.sf.tweety.graphs.Edge<? extends Argument>>	DungTheory.getEdges()
Collection<Argument>	DungTheory.getNeighbors(Argument node)
Collection<Argument>	DungTheory.getNodes()
Collection<Argument>	DungTheory.getParents(net.sf.tweety.graphs.Node node)
net.sf.tweety.graphs.Graph<Argument>	DungTheory.getRestriction(Collection<Argument> arguments)
Collection<Collection<Argument>>	DungTheory.getStronglyConnectedComponents()
Collection<net.sf.tweety.graphs.Graph<Argument>>	DungTheory.getSubgraphs()
Collection<Argument>	GrossiModgilRankingReasoner.gradedDefense(Collection<Argument> args, int m, int n) Implements the graded defense function from Def.
Collection<Argument>	GrossiModgilRankingReasoner.gradedNeutrality(Collection<Argument> args, int m) Implements the graded neutrality function from Def.

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

Modifier and Type	Method and Description
boolean	DungTheory.addAttack(Argument attacker, Argument attacked) Adds an attack from the first argument to the second to thisDdung theory.
boolean	DungTheory.areAdjacent(Argument a, Argument b)
boolean	DungTheory.existsDirectedPath(Argument node1, Argument node2)
Set<Argument>	DungTheory.getAttacked(Argument argument) Computes the set {A | (argument,A) in attacks}.
Set<Argument>	DungTheory.getAttackers(Argument argument) Computes the set {A | (A,argument) in attacks}.
net.sf.tweety.graphs.Edge<Argument>	DungTheory.getEdge(Argument a, Argument b)
Collection<Argument>	DungTheory.getNeighbors(Argument node)
boolean	DungTheory.isAttacked(Argument argument, Extension ext) returns true if some argument of ext attacks argument.
boolean	DungTheory.isAttackedBy(Argument arg1, Argument arg2) Checks whether arg1 is attacked by arg2.
boolean	DungTheory.isAttackedBy(Argument argument, Collection<Argument> ext) returns true if some argument of ext is attacked by argument.
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 with type arguments of type Argument

Modifier and Type	Method and Description
boolean	DungTheory.add(net.sf.tweety.graphs.Edge<Argument> edge)
protected net.sf.tweety.logics.pl.PlBeliefSet	SemiStableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	SemiStableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	SemiStableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StageReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StageReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StageReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	SccCompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	SccCompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	SccCompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	ConflictFreeReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	ConflictFreeReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	ConflictFreeReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	CompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	CompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	CompleteReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected abstract net.sf.tweety.logics.pl.PlBeliefSet	AbstractExtensionReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec) Returns the semantic-specific propositional characterization of the underlying Dung theory, see getPropositionalCharacterisation.
protected abstract net.sf.tweety.logics.pl.PlBeliefSet	AbstractExtensionReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec) Returns the semantic-specific propositional characterization of the underlying Dung theory, see getPropositionalCharacterisation.
protected abstract net.sf.tweety.logics.pl.PlBeliefSet	AbstractExtensionReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec) Returns the semantic-specific propositional characterization of the underlying Dung theory, see getPropositionalCharacterisation.
protected net.sf.tweety.logics.pl.PlBeliefSet	CF2Reasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	CF2Reasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	CF2Reasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	GroundReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	GroundReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	GroundReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	AdmissibleReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	AdmissibleReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	AdmissibleReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	StableReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	PreferredReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	PreferredReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	PreferredReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	IdealReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	IdealReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.PlBeliefSet	IdealReasoner.getPropositionalCharacterisationBySemantics(Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
net.sf.tweety.graphs.Graph<Argument>	DungTheory.getRestriction(Collection<Argument> arguments)
Collection<Argument>	GrossiModgilRankingReasoner.gradedDefense(Collection<Argument> args, int m, int n) Implements the graded defense function from Def.
Collection<Argument>	GrossiModgilRankingReasoner.gradedNeutrality(Collection<Argument> args, int m) Implements the graded neutrality function from Def.
boolean	DungTheory.isAttackedBy(Argument argument, Collection<Argument> ext) returns true if some argument of ext is attacked by argument.
boolean	GrossiModgilRankingReasoner.isMConflictFree(Collection<Argument> args, int m) Checks whether the given set of arguments is m-conflict-free, cf.
boolean	GrossiModgilRankingReasoner.isMNAdmissible(Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-admissible, cf.
boolean	GrossiModgilRankingReasoner.isMNComplete(Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-complete, cf.
boolean	GrossiModgilRankingReasoner.isMNGrounded(Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-grounded, cf.
boolean	GrossiModgilRankingReasoner.isMNPreferred(Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-preferred, cf.
boolean	GrossiModgilRankingReasoner.isMStable(Collection<Argument> args, int m) Checks whether the given set of arguments is m-stable, cf.

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

Constructor and Description
DungTheory(net.sf.tweety.graphs.Graph<Argument> graph) Creates a new theory from the given graph.

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 and Description
Argument	LdoArgument.getArgument() Returns an argument representation (in Dung-style) of this LdoArgument.

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

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

Modifier and Type	Method and Description
static Argument	DungParser.SingleArgument()

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

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

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

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

Modifier and Type	Method and Description
abstract Collection<Argument>	AbstractDungSolver.solveEC(Semantics semantics, DungTheory aaf) Enumerates all arguments that are credulously inferred.
Collection<Argument>	TweetySolver.solveEC(Semantics semantics, DungTheory aaf)
abstract Collection<Collection<Argument>>	AbstractDungSolver.solveEE(Semantics semantics, DungTheory aaf) Enumerates all sets for which there is a labeling that labels exactly these arguments as in.
Collection<Collection<Argument>>	TweetySolver.solveEE(Semantics semantics, DungTheory aaf)
abstract Collection<Argument>	AbstractDungSolver.solveES(Semantics semantics, DungTheory aaf) Enumerates all arguments that skeptically inferred.
Collection<Argument>	TweetySolver.solveES(Semantics semantics, DungTheory aaf)
abstract Collection<Argument>	AbstractDungSolver.solveSE(Semantics semantics, DungTheory aaf) Returns one extension wrt.
Collection<Argument>	TweetySolver.solveSE(Semantics semantics, DungTheory aaf)

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

Modifier and Type	Method and Description
boolean	ProboSolver.justify(Problem problem, DungTheory aaf, FileFormat format, Argument arg) Solves the given justification problem on the given AAF
abstract boolean	AbstractDungSolver.solveDC(Semantics semantics, DungTheory aaf, Argument arg) Solves the problem of deciding whether an argument (given as additional parameter) is credulously inferred and returns either "true" (if it is credulously inferred) or "false" (if it is not credulously inferred)
boolean	TweetySolver.solveDC(Semantics semantics, DungTheory aaf, Argument arg)
abstract boolean	AbstractDungSolver.solveDS(Semantics semantics, DungTheory aaf, Argument arg) Solves the problem of deciding whether an argument (given as additional parameter) is skeptically inferred and returns either "true" (if it is skeptically inferred) or "false" (if it is not skeptically inferred)
boolean	TweetySolver.solveDS(Semantics semantics, DungTheory aaf, Argument arg)

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

Modifier and Type	Method and Description
abstract boolean	AbstractDungSolver.solveDE(Semantics semantics, DungTheory aaf, Collection<Argument> args) Solves the problem of deciding whether there is labeling with the set of arguments (given as additional parameter) being the exact set of argument that is labeled in and returns either "true" (there is such a labeling) or "false" (there is no such labeling).
boolean	TweetySolver.solveDE(Semantics semantics, DungTheory aaf, Collection<Argument> args)

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 and Description
Set<Map.Entry<Argument,ArgumentStatus>>	Labeling.entrySet()
Set<Map.Entry<Argument,Double>>	NumericalArgumentRanking.entrySet()
Set<Map.Entry<Argument,Integer>>	StratifiedLabeling.entrySet()
Collection<Argument>	ArgumentRanking.getMaximallyAcceptedArguments(Collection<Argument> args) Returns the set of all arguments a from the given set that are maximally accepted, i.e.
Collection<Argument>	ArgumentRanking.getMinimallyAcceptedArguments(Collection<Argument> args) Returns the set of all arguments a from the given set that are minimally accepted, i.e.
Iterator<Argument>	Extension.iterator()
Set<Argument>	Labeling.keySet()
Set<Argument>	NumericalArgumentRanking.keySet()
Set<Argument>	StratifiedLabeling.keySet()

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

Modifier and Type	Method and Description
boolean	Extension.add(Argument arg0)
int	ArgumentRanking.compare(Argument arg0, Argument arg1)
boolean	AbstractArgumentationInterpretation.isAcceptable(Argument argument, DungTheory dungTheory) returns true if every attacker on argument is attacked by some accepted argument wrt.
boolean	ArgumentRanking.isEquallyAcceptableThan(Argument a, Argument b) Returns "true" iff a is equally acceptable as b or a and b are not comparable, i.e.
boolean	ArgumentRanking.isStrictlyLessAcceptableThan(Argument a, Argument b) Returns "true" iff a is strictly less acceptable than b, i.e.
boolean	NumericalArgumentRanking.isStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)
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	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 or a and b are not comparable, i.e.
ArgumentStatus	Labeling.put(Argument arg0, ArgumentStatus arg1)
Double	NumericalArgumentRanking.put(Argument arg0, Double arg1)
Integer	StratifiedLabeling.put(Argument arg0, Integer 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.dung.semantics with type arguments of type Argument

Modifier and Type	Method and Description
boolean	Extension.addAll(Collection<? extends Argument> arg0)
Collection<Argument>	ArgumentRanking.getMaximallyAcceptedArguments(Collection<Argument> args) Returns the set of all arguments a from the given set that are maximally accepted, i.e.
Collection<Argument>	ArgumentRanking.getMinimallyAcceptedArguments(Collection<Argument> args) Returns the set of all arguments a from the given set that are minimally accepted, i.e.
void	Labeling.putAll(Map<? extends Argument,? extends ArgumentStatus> arg0)
void	NumericalArgumentRanking.putAll(Map<? extends Argument,? extends Double> arg0)
void	StratifiedLabeling.putAll(Map<? extends Argument,? extends Integer> arg0)

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

Constructor and Description
Extension(Collection<? extends Argument> arguments) Creates a new extension with the given set of arguments.
LatticeArgumentRanking(Collection<Argument> args) Creates a new argument ranking with the given arguments which are initially all incomparable.
NumericalArgumentRanking(Collection<Argument> args, double initialvalue) Creates a new argument ranking.

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 and 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 with parameters of type Argument

Modifier and Type	Method and Description
boolean	Attack.contains(Argument argument) Return true if the given argument is in this attack relation.

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

Modifier and Type	Method and Description
boolean	Attack.isConflictFree(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 and 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 and Description
DungSignature(Collection<? extends Argument> arguments) Creates a new signature with the given set of arguments.

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 and Description
DungTheory	DungTheoryGenerator.generate(Argument arg) Generates a new Dung theory where the given argument is enforced to be in the grounded extension
DungTheory	PodlaszewskiCaminadaDungTheoryGenerator.generate(Argument arg)
DungTheory	FileDungTheoryGenerator.generate(Argument arg)
DungTheory	EnumeratingDungTheoryGenerator.generate(Argument arg)
DungTheory	IsoSafeEnumeratingDungTheoryGenerator.generate(Argument arg)
DungTheory	DefaultDungTheoryGenerator.generate(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 and Description
static String	DungWriter.writeArguments(Collection<Argument> args) Writes the given collection of arguments into a string of the form [arg1,...,argn].