Uses of Class
net.sf.tweety.arg.dung.syntax.Argument
-
-
-
Uses of Argument in net.sf.tweety.agents.dialogues
Fields in net.sf.tweety.agents.dialogues with type parameters of type Argument Modifier and Type Field Description private DialogueTrace<Argument,Extension>
ArgumentationEnvironment. trace
The current dialogue trace.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
Fields in net.sf.tweety.agents.dialogues.oppmodels declared as Argument Modifier and Type Field Description private Argument
GroundedGameUtilityFunction. argument
The argument which is played for or against.Fields in net.sf.tweety.agents.dialogues.oppmodels with type parameters of type Argument Modifier and Type Field Description private UtilityFunction<Argument,Extension>
BeliefState. utilityFunction
The utility function of the agent.private java.util.Set<Argument>
T3BeliefState. virtualArguments
The set of virtual arguments assumed to exist.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 that return types with arguments of type Argument Modifier and Type Method Description protected UtilityFunction<Argument,Extension>
BeliefState. getUtilityFunction()
Returns the utility function of this belief state.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 protected abstract Pair<java.lang.Double,java.util.Set<ExecutableExtension>>
BeliefState. doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
Gives the set of all best next moves with their expected utility according to the belief state and the given trace.Pair<java.lang.Double,java.util.Set<ExecutableExtension>>
T1BeliefState. doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
protected Pair<java.lang.Double,java.util.Set<ExecutableExtension>>
T2BeliefState. doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
protected Pair<java.lang.Double,java.util.Set<ExecutableExtension>>
T3BeliefState. doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
protected java.util.Set<ExecutableExtension>
BeliefState. getLegalMoves(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
Returns the set of possible moves in the given situation and the given trace.protected double
ArguingAgent. getUtility(DialogueTrace<Argument,Extension> trace)
Assess the given dialogue trace with the belief states utility function.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)
private double
GroundedGameUtilityFunction. getUtility(Extension groundedExtension, DialogueTrace<Argument,Extension> trace)
Determines the utility of the given trace with the given grounded extension.private boolean
BeliefState. isLegal(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace, java.util.Set<Argument> move)
Given the theory from the environment and the dialogue trace, returns true if move is a valid move.private boolean
BeliefState. isLegal(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace, java.util.Set<Argument> move)
Given the theory from the environment and the dialogue trace, returns true if move is a valid move.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.agents.dialogues.structured
Methods in net.sf.tweety.agents.dialogues.structured that return types with arguments of type Argument Modifier and Type Method Description protected java.util.Set<Argument>
OvercautiousArgumentationAgent. attackSet()
Computes the attack set of this agent's focal element wrt.protected java.util.Set<Argument>
SasAgent. getPossibleArguments()
Returns the set of arguments this agent may bring forward.protected java.util.Set<Argument>
CautiousArgumentationAgent. necessaryArguments()
Computes the set of necessary arguments for this agent's focal element, i.e. -
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
Fields in net.sf.tweety.arg.bipolar.syntax declared as Argument Modifier and Type Field Description private Argument
EvidentialArgSystem. epsilon
Special argument Epsilon, which serves as a representation of the prima facie argumentsFields in net.sf.tweety.arg.bipolar.syntax with type parameters of type Argument Modifier and Type Field Description private static java.util.Map<BipolarArgFramework,java.util.Collection<Graph<Argument>>>
BipolarArgFramework. archivedSubgraphs
For archiving sub graphsprivate static java.util.Map<BipolarArgFramework,java.util.Collection<Graph<Argument>>>
EvidentialArgSystem. archivedSubgraphs
For archiving sub graphsprivate java.util.Map<Argument,java.util.Set<Argument>>
BipolarArgFramework. supportChildren
private java.util.Map<Argument,java.util.Set<Argument>>
BipolarArgFramework. supportChildren
private java.util.Map<Argument,java.util.Set<Argument>>
BipolarArgFramework. supportParents
explicit listing of direct supporters and supported (for efficiency reasons)private java.util.Map<Argument,java.util.Set<Argument>>
BipolarArgFramework. supportParents
explicit listing of direct supporters and supported (for efficiency reasons)Methods in net.sf.tweety.arg.bipolar.syntax that return Argument Modifier and Type Method Description Argument
EvidentialArgSystem. getEpsilon()
returns the special argument epsilonArgument
Support. getSupported()
returns the supported argument of this support relation.Argument
Support. getSupporter()
returns the supporting argument of this support relation.Methods in net.sf.tweety.arg.bipolar.syntax that return types with arguments of type Argument Modifier and Type Method Description java.util.Set<Argument>
BipolarArgFramework. getDirectSupported(Argument argument)
Computes the set {A | (argument,A) in supports}.java.util.Set<Argument>
BipolarArgFramework. getDirectSupporters(Argument argument)
Computes the set {A | (A,argument) in supports}.java.util.Set<Argument>
EvidentialArgSystem. getEvidenceSupportedArguments()
java.util.Set<Argument>
BipolarArgFramework. getSupported(java.util.Collection<Argument> ext)
Computes the set {A | there is a sequence of direct supports from an element ofext
to Ajava.util.Set<Argument>
BipolarArgFramework. getSupported(Argument argument)
Computes the set {A | there is a sequence of direct supports from argument to Aprivate java.util.Set<Argument>
BipolarArgFramework. getSupported(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from argument to A}.java.util.Set<Argument>
BipolarArgFramework. getSupporters(Argument argument)
Computes the set {A | there is a sequence of direct supports from A to argumentprivate java.util.Set<Argument>
BipolarArgFramework. getSupporters(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from A to argument}.Methods in net.sf.tweety.arg.bipolar.syntax with parameters of type Argument Modifier and Type Method Description boolean
EvidentialArgSystem. addPrimaFacie(Argument argument)
Adds a argument with reasoner.evidential support to this reasoner.evidential argumentation systemboolean
BipolarArgFramework. addSupport(Argument supporter, Argument supported)
Adds a support from the first argument to the second to this bipolar argumentation framework.boolean
BipolarArgFramework. areAdjacent(Argument a, Argument b)
boolean
Support. contains(Argument argument)
Return true if the given argument is in this support relation.java.util.Set<Argument>
BipolarArgFramework. getDirectSupported(Argument argument)
Computes the set {A | (argument,A) in supports}.java.util.Set<Argument>
BipolarArgFramework. getDirectSupporters(Argument argument)
Computes the set {A | (A,argument) in supports}.java.util.Set<Attack>
BipolarArgFramework. getMediatedAttacks(Argument arg1)
Calculates the set of mediated attack from "arg1" to other arguments "y", i.e.java.util.Set<Argument>
BipolarArgFramework. getSupported(Argument argument)
Computes the set {A | there is a sequence of direct supports from argument to Aprivate java.util.Set<Argument>
BipolarArgFramework. getSupported(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from argument to A}.java.util.Set<Attack>
BipolarArgFramework. getSupportedAttacks(Argument arg1)
Calculates the set of supported attack from "arg1" to other arguments "y", i.e.java.util.Set<Argument>
BipolarArgFramework. getSupporters(Argument argument)
Computes the set {A | there is a sequence of direct supports from A to argumentprivate java.util.Set<Argument>
BipolarArgFramework. getSupporters(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from A to argument}.boolean
EvidentialArgSystem. hasEvidentialSupport(Argument argument, java.util.Collection<Argument> ext)
returns true if argument has reasoner.evidential support from setext
.boolean
EvidentialArgSystem. hasMinimalEvidentialSupport(Argument argument, java.util.Collection<Argument> ext)
returns true if argument has minimal reasoner.evidential support from setext
.boolean
EvidentialArgSystem. isAcceptable(Argument argument, java.util.Collection<Argument> ext)
return true if argument is acceptable with respect toext
argument is acceptable wrt.boolean
BipolarArgFramework. isDirectSupportedBy(Argument arg1, Argument arg2)
Checks whether arg1 is directly supported by arg2.boolean
EvidentialArgSystem. isEvidenceSupportedAttack(java.util.Collection<Argument> ext, Argument argument)
returns true ifext
carries out an evidence supported attack on argument ext e-support-attacks an argument a iff an element x of ext attacks a and x has e-support from ext.boolean
BipolarArgFramework. isMediatedAttack(Argument arg1, Argument arg2)
Checks whether there exists a mediated attack from "arg1" to "arg2", i.e.boolean
EvidentialArgSystem. isMinimalEvidenceSupportedAttack(java.util.Collection<Argument> ext, Argument argument)
returns true ifext
carries out a minimal evidence supported attack on argument i.e.boolean
BipolarArgFramework. isSuperMediatedAttack(Argument arg1, Argument arg2)
Checks whether there exists a super-mediated attack from "arg1" to "arg2", i.e.boolean
BipolarArgFramework. isSupported(Argument argument, Extension ext)
returns true if some argument ofext
supports argument.boolean
BipolarArgFramework. isSupportedAttack(Argument arg1, Argument arg2)
Checks whether there exists a supported attack from "arg1" to "arg2", i.e.boolean
BipolarArgFramework. isSupportedBy(Argument argument, java.util.Collection<Argument> ext)
returns true if some argument ofext
is supported by argument.boolean
BipolarArgFramework. isSupportedBy(Argument arg1, Argument arg2)
Checks whether there is a sequence of direct supports from arg1 to arg2.boolean
BipolarArgFramework. remove(Argument a)
Removes the argument and all its attacks and supportsMethod parameters in net.sf.tweety.arg.bipolar.syntax with type arguments of type Argument Modifier and Type Method Description java.util.Set<Argument>
BipolarArgFramework. getSupported(java.util.Collection<Argument> ext)
Computes the set {A | there is a sequence of direct supports from an element ofext
to Aprivate java.util.Set<Argument>
BipolarArgFramework. getSupported(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from argument to A}.private java.util.Set<Argument>
BipolarArgFramework. getSupporters(Argument argument, java.util.Set<Argument> visited)
Computes the set {A | there is a sequence of direct supports from A to argument}.boolean
EvidentialArgSystem. hasEvidentialSupport(Argument argument, java.util.Collection<Argument> ext)
returns true if argument has reasoner.evidential support from setext
.boolean
EvidentialArgSystem. hasMinimalEvidentialSupport(Argument argument, java.util.Collection<Argument> ext)
returns true if argument has minimal reasoner.evidential support from setext
.boolean
EvidentialArgSystem. isAcceptable(Argument argument, java.util.Collection<Argument> ext)
return true if argument is acceptable with respect toext
argument is acceptable wrt.boolean
EvidentialArgSystem. isEvidenceSupportedAttack(java.util.Collection<Argument> ext, Argument argument)
returns true ifext
carries out an evidence supported attack on argument ext e-support-attacks an argument a iff an element x of ext attacks a and x has e-support from ext.boolean
EvidentialArgSystem. isMinimalEvidenceSupportedAttack(java.util.Collection<Argument> ext, Argument argument)
returns true ifext
carries out a minimal evidence supported attack on argument i.e.boolean
BipolarArgFramework. isSupportedBy(Argument argument, java.util.Collection<Argument> ext)
returns true if some argument ofext
is supported by argument.Constructors in net.sf.tweety.arg.bipolar.syntax with parameters of type Argument Constructor Description Support(Argument supporter, Argument supported)
Default constructor; initializes the two arguments used in this support relationConstructor parameters in net.sf.tweety.arg.bipolar.syntax with type arguments of type Argument Constructor Description BipolarArgFramework(Graph<Argument> graph)
Creates a new theory from the given graph.EvidentialArgSystem(Graph<Argument> graph)
Creates a new theory from the given graph. -
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
Fields in net.sf.tweety.arg.dung declared as Argument Modifier and Type Field Description (package private) static Argument
GraphStructureInconsistencyMeasure. a
(package private) static Argument
ExtensionInconsistencyMeasure. a1
(package private) static Argument
ExtensionInconsistencyMeasure. a2
(package private) static Argument
ExtensionInconsistencyMeasure. a3
(package private) static Argument
ExtensionInconsistencyMeasure. a4
(package private) static Argument
ExtensionInconsistencyMeasure. a5
(package private) static Argument
ExtensionInconsistencyMeasure. a6
(package private) static Argument
ExtensionInconsistencyMeasure. a7
(package private) static Argument
ExtensionInconsistencyMeasure. a8
(package private) static Argument
GraphStructureInconsistencyMeasure. b
(package private) static Argument
GraphStructureInconsistencyMeasure. c
(package private) static Argument
GraphStructureInconsistencyMeasure. d
(package private) static Argument
GraphStructureInconsistencyMeasure. e
(package private) static Argument
GraphStructureInconsistencyMeasure. f
(package private) static Argument
GraphStructureInconsistencyMeasure. g
-
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.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)
private java.util.Collection<Argument>
SimpleCF2Reasoner. getOutparents(DungTheory af, java.util.Collection<Argument> s)
Returns the set { a in A | a nicht in S und a -> S }Methods in net.sf.tweety.arg.dung.reasoner with parameters of type Argument Modifier and Type Method Description 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 private java.util.Set<Extension>
SimpleSccCompleteReasoner. computeExtensionsViaSccs(DungTheory theory, java.util.List<java.util.Collection<Argument>> sccs, int idx, java.util.Collection<Argument> in, java.util.Collection<Argument> out, java.util.Collection<Argument> undec)
Computes extensions recursively following the SCC structure.private java.util.Set<Extension>
SimpleSccCompleteReasoner. computeExtensionsViaSccs(DungTheory theory, java.util.List<java.util.Collection<Argument>> sccs, int idx, java.util.Collection<Argument> in, java.util.Collection<Argument> out, java.util.Collection<Argument> undec)
Computes extensions recursively following the SCC structure.private java.util.Set<Extension>
SimpleCompleteReasoner. getCompleteExtensions(DungTheory dungTheory, Extension ext, java.util.Collection<Argument> remaining)
Auxiliary method to compute all complete extensionsprivate java.util.Collection<Argument>
SimpleCF2Reasoner. getOutparents(DungTheory af, java.util.Collection<Argument> s)
Returns the set { a in A | a nicht in S und a -> S }protected abstract PlBeliefSet
AbstractSatExtensionReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec)
Returns the semantic-specific propositional characterization of the underlying Dung theory, seegetPropositionalCharacterisation
.protected PlBeliefSet
SatCompleteReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec)
protected PlBeliefSet
SatStableReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec)
-
Uses of Argument in net.sf.tweety.arg.dung.semantics
Fields in net.sf.tweety.arg.dung.semantics with type parameters of type Argument Modifier and Type Field Description private java.util.Set<Argument>
Extension. arguments
The arguments in the extensionprivate java.util.Map<Argument,ArgumentStatus>
Labeling. labeling
The actual labeling.private java.util.HashMap<Argument,java.lang.Integer>
StratifiedLabeling. map
The actual mapping of arguments to integers.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 onargument
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
Fields in net.sf.tweety.arg.dung.syntax with type parameters of type Argument Modifier and Type Field Description private static java.util.Map<DungTheory,java.util.Collection<Graph<Argument>>>
DungTheory. archivedSubgraphs
For archiving sub graphsprivate java.util.Map<Argument,java.util.Set<Argument>>
DungTheory. children
private java.util.Map<Argument,java.util.Set<Argument>>
DungTheory. children
private java.util.Map<Argument,java.util.Set<Argument>>
DungTheory. parents
explicit listing of direct attackers and attackees (for efficiency reasons)private java.util.Map<Argument,java.util.Set<Argument>>
DungTheory. parents
explicit listing of direct attackers and attackees (for efficiency reasons)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()
Returns the (connected) components of the theoryEdge<Argument>
DungTheory. getEdge(Argument a, Argument b)
java.util.Collection<? extends Edge<? extends Argument>>
DungTheory. getEdges()
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
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)
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 ofext
attacks argument.boolean
DungTheory. isAttackedBy(Argument argument, java.util.Collection<Argument> ext)
returns true if some argument ofext
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.private boolean
DungTheory. isIndirectAttack(Argument arg1, Argument arg2, java.util.Set<Argument> visited)
Checks whether "arg1" indirectly attacks "arg2", i.e.boolean
DungTheory. isSupport(Argument arg1, Argument arg2)
Checks whether "arg1" supports "arg2", i.e.private boolean
DungTheory. isSupport(Argument arg1, Argument arg2, java.util.Set<Argument> visited)
Checks whether "arg1" supports "arg2", i.e.boolean
DungTheory. remove(Argument a)
Removes the argument and all its attacksMethod 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)
private boolean
DungTheory. dfs(int i, java.util.List<Argument> arguments, boolean[] dfn, boolean[] inProgress)
Depth-First-Search to find a cycle in the theory.Graph<Argument>
DungTheory. getRestriction(java.util.Collection<Argument> arguments)
boolean
DungTheory. isAttackedBy(Argument argument, java.util.Collection<Argument> ext)
returns true if some argument ofext
is attacked by argument.boolean
Attack. isConflictFree(java.util.Collection<? extends Argument> arguments)
returns true if one arguments inarguments
attacks another within this attack relation.private boolean
DungTheory. isIndirectAttack(Argument arg1, Argument arg2, java.util.Set<Argument> visited)
Checks whether "arg1" indirectly attacks "arg2", i.e.private boolean
DungTheory. isSupport(Argument arg1, Argument arg2, java.util.Set<Argument> visited)
Checks whether "arg1" supports "arg2", i.e.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 relationDungSignature(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
Fields in net.sf.tweety.arg.dung.util with type parameters of type Argument Modifier and Type Field Description private java.util.Set<Argument>
EnumeratingDungTheoryGenerator. arguments
The current set of arguments.Methods in net.sf.tweety.arg.dung.util with parameters of type Argument Modifier and Type Method Description private DungTheory
DefaultDungTheoryGenerator. generateTreeShape(Argument arg)
Generates a Dung theory with a tree shape where the given argument is the root.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 extensionDungTheory
EnumeratingDungTheoryGenerator. next(Argument arg)
DungTheory
FileDungTheoryGenerator. next(Argument arg)
DungTheory
IsoSafeEnumeratingDungTheoryGenerator. next(Argument arg)
DungTheory
PodlaszewskiCaminadaDungTheoryGenerator. next(Argument arg)
Method parameters in net.sf.tweety.arg.dung.util with type arguments of type Argument Modifier and Type Method Description private java.util.List<Attack>
EnumeratingDungTheoryGenerator. generatePossibleAttacks(java.util.Set<Argument> arguments)
Computes all possible attacks. -
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.dynamics
Method parameters in net.sf.tweety.arg.prob.dynamics with type arguments of type Argument Modifier and Type Method Description protected void
AbstractPAChangeOperator. prepareOptimizationProblem(PartialProbabilityAssignment ppa, DungTheory theory, OptimizationProblem problem, java.util.Map<java.util.Collection<Argument>,FloatVariable> varsComp, java.util.Map<java.util.Collection<Argument>,FloatVariable> varsSem, java.util.Vector<Term> varsCompVector, java.util.Vector<Term> varsSemVector)
-
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.protected Term
AbstractPASemantics. probabilityTerm(Argument arg, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
Constructs the term expressing the probability of the given argument wrt.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)
protected Term
AbstractPASemantics. probabilityTerm(Argument arg, java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
Constructs the term expressing the probability of the given argument wrt. -
Uses of Argument in net.sf.tweety.arg.prob.syntax
Fields in net.sf.tweety.arg.prob.syntax with type parameters of type Argument Modifier and Type Field Description private java.util.Map<Argument,Probability>
ProbabilisticArgumentationFramework. argumentProbabilityAssignment
Probability assignments to arguments (with independence assumption).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 probabilityProbability
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
Fields in net.sf.tweety.arg.rankings.reasoner with type parameters of type Argument Modifier and Type Field Description private java.util.Map<Argument,Pair<int[],int[]>>
TuplesRankingReasoner. tupled_values
Stores the tupled values computed by this reasoner for lookup.Methods in net.sf.tweety.arg.rankings.reasoner that return types with arguments of type Argument Modifier and Type Method Description java.util.HashSet<java.util.ArrayList<Argument>>
DiscussionBasedRankingReasoner. 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.java.util.Map<Argument,Pair<int[],int[]>>
TuplesRankingReasoner. getTupledValues()
java.util.Collection<Argument>
GrossiModgilRankingReasoner. gradedDefense(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Implements the graded defense function from Def.java.util.Collection<Argument>
GrossiModgilRankingReasoner. 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.private boolean
GrossiModgilRankingReasoner. isContainedInAll(Argument y, java.util.Collection<Extension> exts)
Checks whether the given argument "y" is contained in all sets of arguments in "args".private int
GrossiModgilRankingReasoner. numOfAttackers(DungTheory theory, Argument y, java.util.Collection<Argument> x)
Determines the number of attackers from x to y.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.HashSet<java.util.ArrayList<Argument>>
DiscussionBasedRankingReasoner. 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.java.util.Collection<Argument>
GrossiModgilRankingReasoner. gradedDefense(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Implements the graded defense function from Def.java.util.Collection<Argument>
GrossiModgilRankingReasoner. gradedNeutrality(DungTheory theory, java.util.Collection<Argument> args, int m)
Implements the graded neutrality function from Def.boolean
GrossiModgilRankingReasoner. isMConflictFree(DungTheory theory, java.util.Collection<Argument> args, int m)
Checks whether the given set of arguments is m-conflict-free, cf.boolean
GrossiModgilRankingReasoner. isMNAdmissible(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-admissible, cf.boolean
GrossiModgilRankingReasoner. isMNComplete(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-complete, cf.boolean
GrossiModgilRankingReasoner. isMNGrounded(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-grounded, cf.boolean
GrossiModgilRankingReasoner. isMNPreferred(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-preferred, cf.boolean
GrossiModgilRankingReasoner. isMStable(DungTheory theory, java.util.Collection<Argument> args, int m)
Checks whether the given set of arguments is m-stable, cf.private int
GrossiModgilRankingReasoner. numOfAttackers(DungTheory theory, Argument y, java.util.Collection<Argument> x)
Determines the number of attackers from x to y. -
Uses of Argument in net.sf.tweety.arg.rankings.semantics
Fields in net.sf.tweety.arg.rankings.semantics with type parameters of type Argument Modifier and Type Field Description private Order<Argument>
LatticeArgumentRanking. order
The actual orderprivate java.util.Map<Argument,java.lang.Double>
NumericalArgumentRanking. theMap
The actual map used for storing acceptability valuesMethods 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)
int
LatticeArgumentRanking.LatticeComparator. compare(Argument a, Argument b)
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.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)
Method parameters in net.sf.tweety.arg.social.reasoner with type arguments of type Argument Modifier and Type Method Description private double
IssReasoner. dist(SocialMapping<java.lang.Double> sm1, SocialMapping<java.lang.Double> sm2, java.util.Collection<Argument> args)
Returns the maximum-norm distance between the two social mappings -
Uses of Argument in net.sf.tweety.arg.social.semantics
Fields in net.sf.tweety.arg.social.semantics with type parameters of type Argument Modifier and Type Field Description private java.util.Map<Argument,L>
SocialMapping. map
Maps arguments to their valuesMethods 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 argumentL
SocialMapping. put(Argument a, L val)
Sets the social value of the given argumentboolean
SocialMapping. satisfies(Argument formula)
-
Uses of Argument in net.sf.tweety.arg.social.syntax
Fields in net.sf.tweety.arg.social.syntax with type parameters of type Argument Modifier and Type Field Description private java.util.Map<Argument,java.lang.Integer>
SocialAbstractArgumentationFramework. neg_votes
The number of negative votes of argumentsprivate java.util.Map<Argument,java.lang.Integer>
SocialAbstractArgumentationFramework. pos_votes
The number of positive votes of argumentsMethods 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 argumentint
SocialAbstractArgumentationFramework. getPositive(Argument arg)
Returns the number of positive votes of the given argumentboolean
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 argumentvoid
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 argumentConstructor 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.
-