Uses of Class
org.tweetyproject.arg.dung.syntax.Argument
Package
Description
-
Uses of Argument in org.tweetyproject.agents.dialogues
Modifier and TypeMethodDescriptionArgumentationEnvironment.getDialogueTrace()
Returns the current dialogue trace.ModifierConstructorDescriptionExecutableExtension(Collection<? extends Argument> arguments)
Creates a new extension for the given arguments. -
Uses of Argument in org.tweetyproject.agents.dialogues.oppmodels
Modifier and TypeMethodDescriptionRecognitionFunction.getPreimage(Argument a)
Returns the argument which maps to the set containing the given argument.Modifier and TypeMethodDescriptionRecognitionFunction.getPreimage(Argument a)
Returns the argument which maps to the set containing the given argument.Modifier and TypeMethodDescriptionT1BeliefState.doMove(ArgumentationEnvironment env, DialogueTrace<Argument,Extension> trace)
double
GroundedGameUtilityFunction.getUtility(DialogueTrace<Argument,Extension> trace)
double
GroundedGameUtilityFunction.getUtility(DialogueTrace<Argument,Extension> trace, Set<Argument> additionalArguments, Set<Attack> additionalAttacks)
double
GroundedGameUtilityFunction.getUtility(DialogueTrace<Argument,Extension> trace, Set<Argument> additionalArguments, Set<Attack> additionalAttacks)
abstract void
BeliefState.update(DialogueTrace<Argument,Extension> trace)
Updates the current belief state accordingly to the given dialogue trace.void
T1BeliefState.update(DialogueTrace<Argument,Extension> trace)
void
T2BeliefState.update(DialogueTrace<Argument,Extension> trace)
void
T3BeliefState.update(DialogueTrace<Argument,Extension> trace)
ModifierConstructorDescriptionGroundedGameUtilityFunction(DungTheory theory, Argument argument, GroundedGameSystem.AgentFaction faction)
Construct utility function.ModifierConstructorDescriptionBeliefState(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, Set<Argument> virtualArguments, 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, Set<Argument> virtualArguments, Set<Attack> virtualAttacks, RecognitionFunction rec, ProbabilityFunction<T3BeliefState> prob)
Creates a new T3-belief-state with the given parameters. -
Uses of Argument in org.tweetyproject.arg.aba.semantics
-
Uses of Argument in org.tweetyproject.arg.aba.syntax
-
Uses of Argument in org.tweetyproject.arg.aspic.syntax
-
Uses of Argument in org.tweetyproject.arg.bipolar.syntax
Modifier and TypeClassDescriptionclass
This class models an argument used by bipolar abstract argumentation theories.Modifier and TypeMethodDescriptionboolean
Adds argument to this argumentation framework for better compatibility between dung theories and bipolar argumentation frameworks -
Uses of Argument in org.tweetyproject.arg.deductive.syntax
-
Uses of Argument in org.tweetyproject.arg.dung.independence
Modifier and TypeMethodDescriptionstatic SimpleGraph<Argument>
Independence.computeDGraph(DungTheory theory)
transform the given AF into a DAG (D-graph) by adding new meta argument for each strongly connected componentstatic Collection<Collection<Argument>>
Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB)
compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjointstatic Collection<Collection<Argument>>
Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, boolean pruneOutAttacks)
compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjointstatic SimpleGraph<Argument>
Independence.pruneDGraph(SimpleGraph<Argument> dGraph, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC)
prune the given DAG by removing all leaf nodes, which are not in any of the given sets and removing all outgoing edges from nodes in argsCModifier and TypeMethodDescriptionstatic boolean
Independence.isIndependent(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC)
compute whether args and argsB are independent given argsC in the given AF argsA, argsB and argsC are disjointstatic boolean
Independence.isIndependent(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC, boolean pruneOutAttacks)
compute whether args and argsB are independent given argsC in the given AF argsA, argsB and argsC are disjointstatic Collection<Collection<Argument>>
Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB)
compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjointstatic Collection<Collection<Argument>>
Independence.isIndependentGiven(DungTheory theory, Collection<Argument> argsA, Collection<Argument> argsB, boolean pruneOutAttacks)
compute the smallest set of arguments which needs to be observed so that argsA and argsB are independent in the given AF argsA and argsB are disjointstatic SimpleGraph<Argument>
Independence.pruneDGraph(SimpleGraph<Argument> dGraph, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC)
prune the given DAG by removing all leaf nodes, which are not in any of the given sets and removing all outgoing edges from nodes in argsCstatic SimpleGraph<Argument>
Independence.pruneDGraph(SimpleGraph<Argument> dGraph, Collection<Argument> argsA, Collection<Argument> argsB, Collection<Argument> argsC)
prune the given DAG by removing all leaf nodes, which are not in any of the given sets and removing all outgoing edges from nodes in argsC -
Uses of Argument in org.tweetyproject.arg.dung.ldo.syntax
Modifier and TypeMethodDescriptionLdoArgument.getArgument()
Returns an argument representation (in Dung-style) of this LdoArgument. -
Uses of Argument in org.tweetyproject.arg.dung.learning
ModifierConstructorDescriptionImprovedRiveretTheoryLearner(Collection<Argument> arguments, int max_cycles)
initialize learner for the given set of argumentsNiskanenTheorySynthesizer(Collection<Argument> args, Semantics semantics, String solverLocation)
RiveretTheoryLearner(Collection<Argument> arguments, int max_cycles)
initialize learner for the given set of argumentsTheoryLearner(Collection<Argument> args, Semantics semantics, String solverLocation)
-
Uses of Argument in org.tweetyproject.arg.dung.parser
Modifier and TypeMethodDescriptionstatic Collection<Collection<Argument>>
AbstractDungParser.parseExtensionList(String s)
Returns a collection view of the given set of extensions (=sets of arguments) -
Uses of Argument in org.tweetyproject.arg.dung.principles
Modifier and TypeMethodDescriptionboolean
AdmissibilityPrinciple.isApplicable(Collection<Argument> kb)
boolean
CFReinstatementPrinciple.isApplicable(Collection<Argument> kb)
boolean
ConflictFreePrinciple.isApplicable(Collection<Argument> kb)
boolean
DirectionalityPrinciple.isApplicable(Collection<Argument> kb)
boolean
IMaximalityPrinciple.isApplicable(Collection<Argument> kb)
boolean
INRAPrinciple.isApplicable(Collection<Argument> kb)
boolean
ModularizationPrinciple.isApplicable(Collection<Argument> kb)
boolean
NaivetyPrinciple.isApplicable(Collection<Argument> kb)
abstract boolean
Principle.isApplicable(Collection<Argument> kb)
boolean
ReductAdmissibilityPrinciple.isApplicable(Collection<Argument> kb)
boolean
ReinstatementPrinciple.isApplicable(Collection<Argument> kb)
boolean
SccDecomposabilityPrinciple.isApplicable(Collection<Argument> kb)
boolean
SCOOCPrinciple.isApplicable(Collection<Argument> kb)
boolean
SemiQualifiedAdmissibilityPrinciple.isApplicable(Collection<Argument> kb)
boolean
StrongAdmissibilityPrinciple.isApplicable(Collection<Argument> kb)
boolean
WeakReinstatementPrinciple.isApplicable(Collection<Argument> kb)
boolean
AdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
CFReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ConflictFreePrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
DirectionalityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
IMaximalityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
INRAPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ModularizationPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
NaivetyPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
abstract boolean
Principle.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
Principle.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean
Principle.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean
ReductAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
ReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SccDecomposabilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SCOOCPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
SemiQualifiedAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
StrongAdmissibilityPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
boolean
WeakReinstatementPrinciple.isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)
-
Uses of Argument in org.tweetyproject.arg.dung.reasoner
Modifier and TypeMethodDescriptionabstract Collection<Argument>
AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Returns the set of acceptable arguments of this reasoner.EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
IaqAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
SeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
SeemAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)
computes all conflict-free sets, which attack any argument in extWeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)
finds the set of arguments S = {a | there exists an edge between a and 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 AWeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)
computes all conflict-free sets of bbase, that contain only arguments in candidatesOrderingSemanticsReasoner.getConflicts(Extension ext, DungTheory theory)
computes the set of conflicts occurring inside extOrderingSemanticsReasoner.getDefendedNotIn(Extension ext, DungTheory theory)
computes the set of arguments outside of ext, which are defended by extOrderingSemanticsReasoner.getEmpty(Extension ext, DungTheory theory)
dummy method used if only one ordering semantics is specifiedOrderingSemanticsReasoner.getModels(DungTheory theory)
compute the ordering over all subsets of theory wrt.SolidAdmissibleReasoner.getSolidlyDefended(Extension ext, DungTheory theory)
OrderingSemanticsReasoner.getUnattacked(Extension ext, DungTheory theory)
computes the set of arguments outside of ext, which are not attacked by extOrderingSemanticsReasoner.getUndefended(Extension ext, DungTheory theory)
computes the set of arguments in ext, which are not defended by ext against outside attackersModifier and TypeMethodDescriptionWeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)
finds the set of arguments S = {a | there exists an edge between a and argument}boolean
SolidAdmissibleReasoner.isSolidlyDefendedBy(Argument arg, Extension ext, DungTheory theory)
AbstractAcceptabilityReasoner.query(DungTheory beliefbase, Argument formula)
abstract Boolean
AbstractDungReasoner.query(DungTheory beliefbase, Argument formula)
AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula)
AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
Queries the given AAF for the given argument using the given inference type.ProboReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
SatCompleteReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula)
StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula, InferenceMode inferenceMode)
Queries the given AAF for the given argument using the given inference type.Modifier and TypeMethodDescriptionWeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)
computes all conflict-free sets, which attack any argument in extWeaklyAdmissibleReasoner.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 AWeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)
computes all conflict-free sets of bbase, that contain only arguments in candidatesSimpleNaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)
computes all maximal conflict-free sets of bbaseboolean
WeaklyCompleteReasoner.isWeaklyDefendedBy(Collection<Argument> X, Collection<Argument> E, DungTheory theory)
Computes whether E w-defends X i.e. -
Uses of Argument in org.tweetyproject.arg.dung.semantics
Modifier and TypeMethodDescriptionLabeling.entrySet()
StratifiedLabeling.entrySet()
Extension.iterator()
Labeling.keySet()
StratifiedLabeling.keySet()
Modifier and TypeMethodDescriptionboolean
Labeling.put(Argument arg0, ArgumentStatus arg1)
boolean
boolean
Modifier and TypeMethodDescriptionboolean
Extension.addAll(Collection<? extends Argument> arg0)
void
Labeling.putAll(Map<? extends Argument,? extends ArgumentStatus> arg0)
void
ModifierConstructorDescriptionExtension(Collection<? extends Argument> arguments)
Creates a new extension with the given set of arguments. -
Uses of Argument in org.tweetyproject.arg.dung.syntax
Modifier and TypeMethodDescriptionAttack.getAttacked()
returns the attacked argument of this attack relation.Attack.getAttacker()
returns the attacking argument of this attack relation.Modifier and TypeMethodDescriptionDungTheory.getAttacked(Argument argument)
Computes the set {A | (argument,A) in attacks}.DungTheory.getAttackers(Argument argument)
Computes the set {A | (A,argument) in attacks}.DungTheory.getChildren(Node node)
DungTheory.getComponents()
Collection<? extends Edge<? extends Argument>>
DungTheory.getEdges()
DungTheory.getInducedSubgraphs()
DungTheory.getNeighbors(Argument node)
ArgumentationFramework.getNodes()
DungTheory.getNodes()
DungTheory.getParents(Node node)
DungTheory.getRestriction(Collection<Argument> arguments)
DungTheory.getStronglyConnectedComponents()
DungTheory.getSubgraphs()
Modifier and TypeMethodDescriptionboolean
boolean
Adds an attack from the first argument to the second to thisDdung theory.boolean
add attack between both arguments to the theory and set weight to 1boolean
add attack between both arguments to the theory and set weight to given valueboolean
DungTheory.areAdjacent(Argument a, Argument b)
boolean
Return true if the given argument is in this attack relation.boolean
DungTheory.existsDirectedPath(Argument node1, Argument node2)
DungTheory.getAttacked(Argument argument)
Computes the set {A | (argument,A) in attacks}.DungTheory.getAttackers(Argument argument)
Computes the set {A | (A,argument) in attacks}.DungTheory.getNeighbors(Argument node)
return weight of the attack between the given argumentsboolean
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.isAcceptable(Argument argument, Extension ext)
returns true if every attacker onargument
is attacked by some accepted argument wrt.boolean
DungTheory.isAttackBranch(Argument a, Argument b)
Checks whether the path from b to a is an attack branch, i.e.boolean
ArgumentationFramework.isAttacked(Argument a, Extension ext)
boolean
DungTheory.isAttacked(Argument argument, Extension ext)
returns true if some argument ofext
attacks argument.boolean
DungTheory.isAttackedBy(Argument argument, 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.boolean
Checks whether "arg1" supports "arg2", i.e.boolean
Removes the argument and all its attacksModifier and TypeMethodDescriptionboolean
DungTheory.add(GeneralEdge<Argument> edge)
DungTheory.getRestriction(Collection<Argument> arguments)
boolean
DungTheory.isAttackedBy(Argument argument, Collection<Argument> ext)
returns true if some argument ofext
is attacked by argument.boolean
Attack.isConflictFree(Collection<? extends Argument> arguments)
returns true if one arguments inarguments
attacks another within this attack relation.ModifierConstructorDescriptionDefault constructor; initializes the two arguments used in this attack relationDungSignature(Argument argument)
Creates a new signature with the single given argument.ModifierConstructorDescriptionDungSignature(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 org.tweetyproject.arg.dung.util
Modifier and TypeMethodDescriptionGenerates a new Dung theory where the given argument is enforced to be in the grounded extension -
Uses of Argument in org.tweetyproject.arg.dung.writer
Modifier and TypeMethodDescriptionstatic String
AbstractDungWriter.writeArguments(Collection<Argument> args)
Writes the given collection of arguments into a string of the form [arg1,...,argn]. -
Uses of Argument in org.tweetyproject.arg.prob.lotteries
Modifier and TypeMethodDescriptionSubgraphProbabilityFunction.getAcceptanceProbability(Argument arg, Semantics semantics)
Returns the probability of the given argument being acceptable wrt.SubgraphProbabilityFunction.getEpistemicProbability(Argument arg)
Returns the epistemic probability of the given argument, i.e. -
Uses of Argument in org.tweetyproject.arg.prob.reasoner
Modifier and TypeMethodDescriptionAbstractPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula)
abstract Double
AbstractPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)
Queries the given PAF for the given argument using the given inference type.MonteCarloPafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)
SimplePafReasoner.query(ProbabilisticArgumentationFramework beliefbase, Argument formula, InferenceMode inferenceMode)
-
Uses of Argument in org.tweetyproject.arg.prob.semantics
Modifier and TypeMethodDescriptionProbabilisticExtension.probability(Argument a)
Computes the probability of the given argument.Modifier and TypeMethodDescriptionabstract Collection<Statement>
AbstractPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
CoherentPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
FoundedPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
InvolutaryPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
JustifiablePASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
NeutralPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
OptimisticPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
PASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
Returns the mathematical statement corresponding to the satisfaction of the given theory wrt.RationalPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
SemiFoundedPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
SemiOptimisticPASemantics.getSatisfactionStatements(DungTheory theory, Map<Collection<Argument>,FloatVariable> worlds2vars)
-
Uses of Argument in org.tweetyproject.arg.prob.syntax
Modifier and TypeMethodDescriptionboolean
boolean
ProbabilisticArgumentationFramework.add(Argument a, Probability p)
Adds the given argument with the given probabilityProbabilisticArgumentationFramework.getProbability(Argument a)
Returns the probability of the given argument.boolean
ModifierConstructorDescriptionCreates a new PAF from the given graph, all arguments and attacks have probability 1. -
Uses of Argument in org.tweetyproject.arg.rankings.postulates
Modifier and TypeMethodDescriptionboolean
RaAbstraction.isApplicable(Collection<Argument> kb)
boolean
RaAdditionOfAttackBranch.isApplicable(Collection<Argument> kb)
boolean
RaAdditionOfDefenseBranch.isApplicable(Collection<Argument> kb)
boolean
RaAttackVsFullDefense.isApplicable(Collection<Argument> kb)
boolean
RaCardinalityPrecedence.isApplicable(Collection<Argument> kb)
boolean
RaCounterTransitivity.isApplicable(Collection<Argument> kb)
boolean
RaDefensePrecedence.isApplicable(Collection<Argument> kb)
boolean
RaDistDefensePrecedence.isApplicable(Collection<Argument> kb)
boolean
RaIncreaseOfAttackBranch.isApplicable(Collection<Argument> kb)
boolean
RaIncreaseOfDefenseBranch.isApplicable(Collection<Argument> kb)
boolean
RaIndependence.isApplicable(Collection<Argument> kb)
abstract boolean
RankingPostulate.isApplicable(Collection<Argument> kb)
boolean
RaNonAttackedEquivalence.isApplicable(Collection<Argument> kb)
boolean
RaQualityPrecedence.isApplicable(Collection<Argument> kb)
boolean
RaSelfContradiction.isApplicable(Collection<Argument> kb)
boolean
RaStrictAdditionOfDefenseBranch.isApplicable(Collection<Argument> kb)
boolean
RaStrictCounterTransitivity.isApplicable(Collection<Argument> kb)
boolean
RaTotal.isApplicable(Collection<Argument> kb)
boolean
RaVoidPrecedence.isApplicable(Collection<Argument> kb)
boolean
RaAbstraction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaAdditionOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaAttackVsFullDefense.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaCardinalityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaDistDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaIncreaseOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaIncreaseOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaIndependence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
abstract boolean
RankingPostulate.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RankingPostulate.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean
RankingPostulate.isSatisfied(Collection<Argument> kb, PostulateEvaluatable<Argument> ev)
boolean
RaNonAttackedEquivalence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaQualityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaSelfContradiction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaStrictAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaStrictCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaTotal.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
boolean
RaVoidPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<ArgumentRanking> ev)
-
Uses of Argument in org.tweetyproject.arg.rankings.reasoner
Modifier and TypeMethodDescriptionTuplesRankingReasoner.getTupledValues()
IteratedGradedDefenseReasoner.gradedDefense(DungTheory theory, Collection<Argument> args, int m, int n)
Implements the graded defense function from Def.IteratedGradedDefenseReasoner.gradedNeutrality(DungTheory theory, Collection<Argument> args, int m)
Implements the graded neutrality function from Def.Modifier and TypeMethodDescriptiondouble
StrategyBasedRankingReasoner.computeStrengthOfArgument(Argument a, DungTheory kb, Set<Set<Argument>> subsets)
Computes the value of the zero-sum game for the given argument.Pair<int[],int[]>
TuplesRankingReasoner.computeTupledValue(Argument a, DungTheory kb)
Computes the tupled value for the given argument.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.Modifier and TypeMethodDescriptiondouble
StrategyBasedRankingReasoner.computeDegreeOfAcceptability(Collection<Argument> A, Collection<Argument> B, DungTheory kb)
Computes the degree of acceptability of the strategy A wrt.double
StrategyBasedRankingReasoner.computeRewards(Collection<Argument> A, Collection<Argument> B, DungTheory kb)
Computes the rewards of the given strategy (set of arguments).double
StrategyBasedRankingReasoner.computeStrengthOfArgument(Argument a, DungTheory kb, Set<Set<Argument>> subsets)
Computes the value of the zero-sum game for the given argument.IteratedGradedDefenseReasoner.gradedDefense(DungTheory theory, Collection<Argument> args, int m, int n)
Implements the graded defense function from Def.IteratedGradedDefenseReasoner.gradedNeutrality(DungTheory theory, Collection<Argument> args, int m)
Implements the graded neutrality function from Def.boolean
IteratedGradedDefenseReasoner.isMConflictFree(DungTheory theory, Collection<Argument> args, int m)
Checks whether the given set of arguments is m-conflict-free, cf.boolean
IteratedGradedDefenseReasoner.isMNAdmissible(DungTheory theory, Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-admissible, cf.boolean
IteratedGradedDefenseReasoner.isMNComplete(DungTheory theory, Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-complete, cf.boolean
IteratedGradedDefenseReasoner.isMNGrounded(DungTheory theory, Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-grounded, cf.boolean
IteratedGradedDefenseReasoner.isMNPreferred(DungTheory theory, Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-preferred, cf.boolean
IteratedGradedDefenseReasoner.isMStable(DungTheory theory, Collection<Argument> args, int m)
Checks whether the given set of arguments is m-stable, cf. -
Uses of Argument in org.tweetyproject.arg.rankings.semantics
Modifier and TypeMethodDescriptionNumericalArgumentRanking.entrySet()
LatticeArgumentRanking.getArgs()
ArgumentRanking.getMaximallyAcceptedArguments(Collection<Argument> args)
Returns the set of all arguments a from the given set that are maximally accepted, i.e.ArgumentRanking.getMinimallyAcceptedArguments(Collection<Argument> args)
Returns the set of all arguments a from the given set that are minimally accepted, i.e.LatticeArgumentRanking.getOrder()
NumericalArgumentRanking.keySet()
Modifier and TypeMethodDescriptionint
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.void
LatticeArgumentRanking.setStrictlyLessOrEquallyAcceptableThan(Argument a, Argument b)
Defines argument "a" to be strictly less or equally acceptable than argument "b".Modifier and TypeMethodDescriptionArgumentRanking.getMaximallyAcceptedArguments(Collection<Argument> args)
Returns the set of all arguments a from the given set that are maximally accepted, i.e.ArgumentRanking.getMinimallyAcceptedArguments(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, Collection<Argument> args)
Checks whether this ranking is equivalent to the other one wrt.void
ModifierConstructorDescriptionLatticeArgumentRanking(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 with the given set of arguments and the given initial ranking value. -
Uses of Argument in org.tweetyproject.arg.rankings.util
Modifier and TypeMethodDescriptionRankingTools.getPathsOfHigherSize(HashSet<ArrayList<Argument>> oldPaths, DungTheory base)
Given a set of argument paths of length i-1, this method returns a set of argument paths of length i for the given DungTheory.Modifier and TypeMethodDescriptionRankingTools.getPathsOfHigherSize(HashSet<ArrayList<Argument>> oldPaths, DungTheory base)
Given a set of argument paths of length i-1, this method returns a set of argument paths of length i for the given DungTheory. -
Uses of Argument in org.tweetyproject.arg.saf.syntax
Modifier and TypeClassDescriptionclass
This class models an argument structure, i.e.class
This class models a basic argument in structured argumentation frameworks, i.e.Modifier and TypeMethodDescriptionboolean
StructuredArgumentationFramework.isAttackedBy(Argument arg1, Argument arg2)
-
Uses of Argument in org.tweetyproject.arg.setaf.reasoners
Modifier and TypeMethodDescriptionAbstractExtensionSetAfReasoner.query(SetAf beliefbase, Argument formula, InferenceMode inferenceMode)
Queries the given AAF for the given argument using the given inference type.abstract Boolean
Modifier and TypeMethodDescriptionSimpleNaiveSetAfReasoner.getMaximalConflictFreeSets(SetAf bbase, Collection<Argument> candidates)
computes all maximal conflict-free sets of bbase -
Uses of Argument in org.tweetyproject.arg.setaf.syntax
Modifier and TypeMethodDescriptionSetAttack.getAttacked()
returns the attacked argument of this attack relation.Modifier and TypeMethodDescriptionSetAf.getAttacked(Argument node)
Computes the set {A | (argument,A) in attacks}.SetAf.getAttackers(Argument node)
Computes the set {A | (A,argument) in attacks}.SetAttack.getAttackers()
returns the attacking argument of this attack relation.SetAf.getChildren(Set<Argument> node)
SetAf.getChildren(Node node)
SetAf.getNeighbors(Argument node)
SetAf.getNodes()
SetAf.getParents(Argument node)
SetAf.getParents(Node node)
SetAf.getSubGraphs()
static Collection<DirHyperGraph<Argument>>
SetAf.getSubgraphsHelper(SetAf g)
SetAf.iterator()
Modifier and TypeMethodDescriptionboolean
boolean
Adds an attack from the first argument to the second to this SetAf theory.boolean
Adds an attack from the first argument to the second to this SetAf theory.boolean
SetAf.areAdjacent(Argument a, Argument b)
boolean
Return true if the given argument is in this attack relation.boolean
SetAf.existsDirectedPath(Argument node1, Argument node2)
static <S extends Node>
booleanSetAf.existsDirectedPath(SetAf hyperGraph, Argument node1, Argument node2)
SetAf.getAttacked(Argument node)
Computes the set {A | (argument,A) in attacks}.SetAf.getAttackers(Argument node)
Computes the set {A | (A,argument) in attacks}.SetAf.getNeighbors(Argument node)
SetAf.getParents(Argument node)
boolean
SetAf.isAcceptable(Argument argument, Extension ext)
returns true if every attacker onargument
is attacked by some accepted argument wrt.boolean
SetAf.isAttacked(Argument a, Extension setAfExtension)
returns true if some argument ofext
attacks argument.boolean
SetAf.isAttackedBy(Argument arg2, Collection<Argument> ext)
returns true if some argument ofext
is attacked by argument.boolean
SetAf.isAttackedBy(Argument arg1, Argument arg2)
Checks whether arg1 is attacked by arg2.boolean
Removes the argument and all its attacksModifier and TypeMethodDescriptionboolean
Adds an attack from the first argument to the second to this SetAf theory.SetAf.getChildren(Set<Argument> node)
SetAf.getDirEdge(Set<Argument> node1, Node b)
SetAf.getRestriction(Collection<Argument> nodes)
boolean
SetAf.isAttackedBy(Argument arg2, Collection<Argument> ext)
returns true if some argument ofext
is attacked by argument.boolean
SetAf.isConflictFree(Collection<? extends Argument> arguments)
returns true if one arguments inarguments
attacks another within this attack relation.boolean
SetAttack.isConflictFree(Collection<? extends Argument> arguments)
returns true if one arguments inarguments
attacks another within this attack relation.ModifierConstructorDescriptionSetAfSignature(Argument argument)
Creates a new signature with the single given argument.Default constructor; initializes the two arguments used in this attack relationDefault constructor; initializes the two arguments used in this attack relationModifierConstructorDescriptionSetAfSignature(Collection<? extends Argument> arguments)
Creates a new signature with the given set of arguments.Default constructor; initializes the two arguments used in this attack relation -
Uses of Argument in org.tweetyproject.arg.social.reasoner
Modifier and TypeMethodDescriptionIssReasoner.query(SocialAbstractArgumentationFramework beliefbase, Argument formula)
-
Uses of Argument in org.tweetyproject.arg.social.semantics
Modifier and TypeMethodDescriptionboolean
SocialMapping.containsKey(Argument a)
Returns "true" iff the given argument has a value.Returns the social value of the given argumentSets the social value of the given argumentboolean
-
Uses of Argument in org.tweetyproject.arg.social.syntax
Modifier and TypeMethodDescriptionboolean
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
void
Adds a negative vote to the given argument.void
Adds the given number of negative votes to the given argumentvoid
Adds a positive vote to the given argument.void
Adds the given number of positive votes to the given argumentModifierConstructorDescriptionCreates a new social abstract argumentation framework from the given graph.