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

Packages that use Argument

Package	Description
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

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(Collection<Argument> arguments, int max_cycles)	initialize learner for the given set of arguments
RiveretTheoryLearner(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 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.reasoner

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

Modifier and Type	Method	Description
abstract Collection<Argument>	AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)	Returns the set of acceptable arguments of this reasoner.
Collection<Argument>	EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	IaqAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeemAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttacked(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacked by an element of arguments in bbase
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttackers(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacking an element of arguments in bbase
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
Collection<Argument>	OrderingSemanticsReasoner.getConflicts(Extension ext, DungTheory theory)	computes the set of conflicts occurring inside ext
Collection<Argument>	OrderingSemanticsReasoner.getDefendedNotIn(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
Collection<Argument>	OrderingSemanticsReasoner.getEmpty(Extension ext, DungTheory theory)	dummy method used if only one ordering semantics is specified
Collection<Argument>	OrderingSemanticsReasoner.getUnattacked(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
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
Set<Argument>	WeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)	finds the set of arguments S = {a | there exists an edge between a and argument}
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, net.sf.tweety.commons.InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
Boolean	ProboReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)
Boolean	SatCompleteReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.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
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttacked(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacked by an element of arguments in bbase
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttackers(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacking an element of arguments in bbase
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)	computes all conflict-free sets, which attack any argument in ext
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
Collection<Extension>	NaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all maximal conflict-free sets of bbase
protected abstract net.sf.tweety.logics.pl.syntax.PlBeliefSet	AbstractSatExtensionReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, 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.syntax.PlBeliefSet	SatCompleteReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, 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.syntax.PlBeliefSet	SatStableReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, 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)

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
Set<Map.Entry<Argument,ArgumentStatus>>	Labeling.entrySet()
Set<Map.Entry<Argument,Integer>>	StratifiedLabeling.entrySet()
Iterator<Argument>	Extension.iterator()
Set<Argument>	Labeling.keySet()
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)
Integer	StratifiedLabeling.put(Argument arg0, 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(Collection<? extends Argument> arg0)
void	Labeling.putAll(Map<? extends Argument,? extends ArgumentStatus> 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	Description
Extension(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
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)
Collection<net.sf.tweety.graphs.Graph<Argument>>	DungTheory.getComponents()
net.sf.tweety.graphs.Edge<Argument>	DungTheory.getEdge(Argument a, Argument b)
Collection<? extends net.sf.tweety.graphs.Edge<? extends Argument>>	DungTheory.getEdges()
Collection<net.sf.tweety.graphs.Graph<Argument>>	DungTheory.getInducedSubgraphs()
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()

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)
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)
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, 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(net.sf.tweety.graphs.Edge<Argument> edge)
net.sf.tweety.graphs.Graph<Argument>	DungTheory.getRestriction(Collection<Argument> arguments)
boolean	DungTheory.isAttackedBy(Argument argument, Collection<Argument> ext)	returns true if some argument of ext is attacked by argument.
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	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(Collection<? extends Argument> arguments)	Creates a new signature with the given set of arguments.
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.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 String	AbstractDungWriter.writeArguments(Collection<Argument> args)	Writes the given collection of arguments into a string of the form [arg1,...,argn].