Uses of Class
org.tweetyproject.arg.dung.syntax.DungTheory
-
-
-
Uses of DungTheory in org.tweetyproject.agents.dialogues
Subclasses of DungTheory in org.tweetyproject.agents.dialogues Modifier and Type Class Description class
ExecutableDungTheory
This class packs a Dung theory into an executable object.Methods in org.tweetyproject.agents.dialogues that return DungTheory Modifier and Type Method Description DungTheory
ArgumentationEnvironment. getPerceivedDungTheory(Extension arguments)
Returns the view of the universal Dung theory restricted to the given set of arguments.DungTheory
LotteryArgumentationEnvironment. getPerceivedDungTheory(Extension arguments)
Returns the view of the universal Dung theory restricted to the given set of arguments.Methods in org.tweetyproject.agents.dialogues that return types with arguments of type DungTheory Modifier and Type Method Description DialogueTrace<DungTheory,java.util.Collection<DungTheory>>
LotteryArgumentationEnvironment. getDialogueTrace()
Returns the current dialogue trace.DialogueTrace<DungTheory,java.util.Collection<DungTheory>>
LotteryArgumentationEnvironment. getDialogueTrace()
Returns the current dialogue trace.Constructors in org.tweetyproject.agents.dialogues with parameters of type DungTheory Constructor Description ArgumentationEnvironment(DungTheory universalTheory)
Creates a new grounded environment.ExecutableDungTheory(DungTheory theory)
Creates a new dung theory for the given Dung theory.LotteryArgumentationEnvironment(DungTheory universalTheory)
Creates a new grounded environment. -
Uses of DungTheory in org.tweetyproject.agents.dialogues.lotteries
Methods in org.tweetyproject.agents.dialogues.lotteries that return DungTheory Modifier and Type Method Description DungTheory
AbstractLotteryAgent. getTheory()
Returns the theory of this agent.DungTheory
ProbabilisticLotteryAgent. getTheory()
Returns the theory of this agent.Methods in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheory Modifier and Type Method Description abstract double
AbstractLotteryAgent. getUtility(DungTheory theory, Semantics semantics)
Returns the utility of the agent wrt.double
DummyLotteryAgent. getUtility(DungTheory theory, Semantics semantics)
double
ProbabilisticLotteryAgent. getUtility(DungTheory theory, Semantics semantics)
double
RandomLotteryAgent. getUtility(DungTheory theory, Semantics semantics)
double
UtilityBasedLotteryAgent. getUtility(DungTheory theory, Semantics semantics)
Constructors in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheory Constructor Description AbstractLotteryAgent(java.lang.String name, DungTheory theory, Semantics semantics)
Creates a new lottery agentDummyLotteryAgent(java.lang.String name, DungTheory theory, Semantics semantics)
LotteryGameSystem(DungTheory universalTheory)
Creates a new grounded game system.ProbabilisticLotteryAgent(java.lang.String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics)
Creates a new lottery agentProbabilisticLotteryAgent(java.lang.String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy)
Creates a new lottery agentProbabilisticLotteryAgent(java.lang.String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy, double stickynesscoefficient)
Creates a new lottery agentRandomLotteryAgent(java.lang.String name, DungTheory theory, UtilityFunction util, Semantics semantics)
Creates a new agent with the given name, theory, utility function and semanticsUtilityBasedLotteryAgent(java.lang.String name, DungTheory theory, UtilityFunction util, Semantics semantics)
-
Uses of DungTheory in org.tweetyproject.agents.dialogues.oppmodels
Constructors in org.tweetyproject.agents.dialogues.oppmodels with parameters of type DungTheory Constructor Description GroundedGameSystem(DungTheory universalTheory)
Creates a new grounded game system.GroundedGameUtilityFunction(DungTheory theory, Argument argument, GroundedGameSystem.AgentFaction faction)
Construct utility function. -
Uses of DungTheory in org.tweetyproject.agents.dialogues.structured
Subclasses of DungTheory in org.tweetyproject.agents.dialogues.structured Modifier and Type Class Description class
PerceivableStructuredArgumentationFramework
This class packs a structured argumentation framework into a perceivable object. -
Uses of DungTheory in org.tweetyproject.arg.aba.syntax
Methods in org.tweetyproject.arg.aba.syntax that return DungTheory Modifier and Type Method Description DungTheory
AbaTheory. asDungTheory()
-
Uses of DungTheory in org.tweetyproject.arg.aspic.reasoner
Methods in org.tweetyproject.arg.aspic.reasoner that return DungTheory Modifier and Type Method Description DungTheory
DirectionalAspicReasoner. asRestrictedDungTheory(AspicArgumentationTheory<T> aat, boolean simplifyArgumentStructure, T conc)
Generate restricted AF based on given theory and conclusion.abstract DungTheory
AbstractAspicReasoner. getDungTheory(AspicArgumentationTheory<T> aat, T query)
Computes the Dung theory from which the answer will be derivedDungTheory
DirectionalAspicReasoner. getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory
ModuleBasedAspicReasoner. getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory
RandomAspicReasoner. getDungTheory(AspicArgumentationTheory<T> aat, T query)
DungTheory
SimpleAspicReasoner. getDungTheory(AspicArgumentationTheory<T> aat, T query)
Methods in org.tweetyproject.arg.aspic.reasoner with parameters of type DungTheory Modifier and Type Method Description java.lang.Boolean
AbstractAspicReasoner. query(DungTheory dt, T query, InferenceMode inferenceMode)
-
Uses of DungTheory in org.tweetyproject.arg.aspic.syntax
Methods in org.tweetyproject.arg.aspic.syntax that return DungTheory Modifier and Type Method Description DungTheory
AspicArgumentationTheory. asDungTheory()
This method transfers this Aspic+ theory into a Dung style argumentation systemDungTheory
AspicArgumentationTheory. asDungTheory(boolean simplifyArgumentStructure)
This method transfers this Aspic+ theory into a Dung style argumentation system -
Uses of DungTheory in org.tweetyproject.arg.bipolar.syntax
Methods in org.tweetyproject.arg.bipolar.syntax that return DungTheory Modifier and Type Method Description DungTheory
DeductiveArgumentationFramework. getCompleteAssociatedDungTheory()
constructs the complete associated dung theory of this bipolar argumentation framework i.e.DungTheory
DeductiveArgumentationFramework. getMetaFramework()
constructs the meta dung theory of this bipolar argumentation framework by adding meta-arguments for every attack and support relation See Boella et al. -
Uses of DungTheory in org.tweetyproject.arg.deductive.syntax
Methods in org.tweetyproject.arg.deductive.syntax that return DungTheory Modifier and Type Method Description DungTheory
SimplePlLogicDeductiveKnowledgebase. getAF()
Builds simple logic arguments and attacks among them---simple undercut and simple rebuttal---as described in http://www0.cs.ucl.ac.uk/staff/a.hunter/papers/ac13t.pdf -
Uses of DungTheory in org.tweetyproject.arg.delp.syntax
Methods in org.tweetyproject.arg.delp.syntax that return DungTheory Modifier and Type Method Description DungTheory
DefeasibleLogicProgram. getDungTheory()
This method translates this delp into an abstract Dung theory. -
Uses of DungTheory in org.tweetyproject.arg.dung.analysis
Classes in org.tweetyproject.arg.dung.analysis with type parameters of type DungTheory Modifier and Type Class Description class
CycleCountInconsistencyMeasure<T extends DungTheory>
class
DrasticInconsistencyMeasure<T extends DungTheory>
interface
InconsistencyMeasure<T extends DungTheory>
class
InSumInconsistencyMeasure<T extends DungTheory>
class
NonGroundedCountInconsistencyMeasure<T extends DungTheory>
class
PreferredCountInconsistencyMeasure<T extends DungTheory>
class
UnstableCountInconsistencyMeasure<T extends DungTheory>
class
WeightedComponentCountInconsistencyMeasure<T extends DungTheory>
class
WeightedCycleCountInconsistencyMeasure<T extends DungTheory>
class
WeightedInSumInconsistencyMeasure<T extends DungTheory>
class
WeightedOutSumInconsistencyMeasure<T extends DungTheory>
-
Uses of DungTheory in org.tweetyproject.arg.dung.divisions
Methods in org.tweetyproject.arg.dung.divisions that return types with arguments of type DungTheory Modifier and Type Method Description java.util.Collection<DungTheory>
Division. getDividers(DungTheory theory, Semantics semantics)
Returns the dividers for this division, i.e.Methods in org.tweetyproject.arg.dung.divisions with parameters of type DungTheory Modifier and Type Method Description java.util.Collection<DungTheory>
Division. getDividers(DungTheory theory, Semantics semantics)
Returns the dividers for this division, i.e.static java.util.Collection<Division>
Division. getDivisions(java.util.Collection<Extension> exts, DungTheory aaf)
Returns all divisions of all given extensions and the given aaf.static java.util.Collection<Division>
Division. getDivisions(Extension ext, DungTheory aaf)
Returns all divisions of aaf that arise from the given extension.static java.util.Collection<Division>
Division. getStandardDivisions(DungTheory theory)
Returns the standard set of divisions of the given argumentation theory, i.e.static boolean
Division. isDisjoint(java.util.Collection<Division> divisions, DungTheory theory, Semantics semantics)
Checks whether the given set o divisions is disjoint wrt.static boolean
Division. isExhaustive(java.util.Collection<Division> divisions, DungTheory theory, Semantics semantics)
Checks whether the given set of divisions is exhaustive wrt. -
Uses of DungTheory in org.tweetyproject.arg.dung.equivalence
Methods in org.tweetyproject.arg.dung.equivalence that return DungTheory Modifier and Type Method Description DungTheory
EquivalenceKernel. getKernel(DungTheory theory)
computes the kernel of the given AFMethods in org.tweetyproject.arg.dung.equivalence that return types with arguments of type DungTheory Modifier and Type Method Description java.util.Collection<DungTheory>
StrongEquivalence. getStronglyEquivalentTheories(DungTheory theory)
compute all strongly equivalent theories for the the given theory i.e.java.util.Collection<DungTheory>
StrongEquivalence. getStronglyEquivalentTheoriesNaive(DungTheory baseTheory)
compute all strongly equivalent theories for the given theory i.e.Methods in org.tweetyproject.arg.dung.equivalence with parameters of type DungTheory Modifier and Type Method Description DungTheory
EquivalenceKernel. getKernel(DungTheory theory)
computes the kernel of the given AFjava.util.Collection<DungTheory>
StrongEquivalence. getStronglyEquivalentTheories(DungTheory theory)
compute all strongly equivalent theories for the the given theory i.e.java.util.Collection<DungTheory>
StrongEquivalence. getStronglyEquivalentTheoriesNaive(DungTheory baseTheory)
compute all strongly equivalent theories for the given theory i.e.java.util.Collection<Attack>
AdmissibleKernel. getUselessAttacks(DungTheory theory)
java.util.Collection<Attack>
CompleteKernel. getUselessAttacks(DungTheory theory)
abstract java.util.Collection<Attack>
EquivalenceKernel. getUselessAttacks(DungTheory theory)
compute the set of 'useless' attacks, i.e.java.util.Collection<Attack>
GroundedKernel. getUselessAttacks(DungTheory theory)
java.util.Collection<Attack>
StableKernel. getUselessAttacks(DungTheory theory)
boolean
StrongEquivalence. isStronglyEquivalent(DungTheory theory1, DungTheory theory2)
compute whether the given theories are equivalent wrt.Method parameters in org.tweetyproject.arg.dung.equivalence with type arguments of type DungTheory Modifier and Type Method Description boolean
StrongEquivalence. isStronglyEquivalent(java.util.Collection<DungTheory> theories)
compute whether the given theories are equivalent wrt. -
Uses of DungTheory in org.tweetyproject.arg.dung.independence
Methods in org.tweetyproject.arg.dung.independence with parameters of type DungTheory Modifier and Type Method Description static 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 boolean
Independence. isIndependent(DungTheory theory, java.util.Collection<Argument> argsA, java.util.Collection<Argument> argsB, java.util.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, java.util.Collection<Argument> argsA, java.util.Collection<Argument> argsB, java.util.Collection<Argument> argsC, boolean pruneOutAttacks)
compute whether args and argsB are independent given argsC in the given AF argsA, argsB and argsC are disjointstatic java.util.Collection<java.util.Collection<Argument>>
Independence. isIndependentGiven(DungTheory theory, java.util.Collection<Argument> argsA, java.util.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 java.util.Collection<java.util.Collection<Argument>>
Independence. isIndependentGiven(DungTheory theory, java.util.Collection<Argument> argsA, java.util.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 disjoint -
Uses of DungTheory in org.tweetyproject.arg.dung.ldo.semantics
Methods in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheory Modifier and Type Method Description boolean
LdoInterpretation. satisfies(DungTheory beliefBase)
Constructors in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheory Constructor Description LdoInterpretation(DungTheory theory, Extension ext, Semantics semantics)
Creates a new interpretationLdoInterpretation(DungTheory theory, Semantics semantics)
Creates a new interpretation -
Uses of DungTheory in org.tweetyproject.arg.dung.ldo.syntax
Methods in org.tweetyproject.arg.dung.ldo.syntax that return types with arguments of type DungTheory Modifier and Type Method Description java.util.Collection<DungTheory>
LdoFormula. getDividers(DungTheory theory, Semantics semantics)
Returns the dividers for this formula, i.e.Methods in org.tweetyproject.arg.dung.ldo.syntax with parameters of type DungTheory Modifier and Type Method Description java.util.Collection<DungTheory>
LdoFormula. getDividers(DungTheory theory, Semantics semantics)
Returns the dividers for this formula, i.e. -
Uses of DungTheory in org.tweetyproject.arg.dung.learning
Methods in org.tweetyproject.arg.dung.learning that return DungTheory Modifier and Type Method Description DungTheory
NiskanenTheorySynthesizer. learnExamples(java.util.Map<Extension,java.lang.Integer> positiveExamples, java.util.Map<Extension,java.lang.Integer> negativeExamples)
learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examplesDungTheory
TheoryLearner. learnExamples(java.util.Map<Labeling,java.lang.Integer> positiveExamples, java.util.Map<Labeling,java.lang.Integer> negativeExamples)
learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examplesDungTheory
ImprovedRiveretTheoryLearner. learnLabelings(java.util.ArrayList<Labeling> labelings)
learn theory without pruning discarded attacksDungTheory
ImprovedRiveretTheoryLearner. learnLabelings(java.util.ArrayList<Labeling> labelings, boolean prune, int threshold)
learn random labelings from the given List until no undecided attacks are left in the theoryDungTheory
RiveretTheoryLearner. learnLabelings(java.util.ArrayList<Labeling> labelings)
learn theory without pruning discarded attacksDungTheory
RiveretTheoryLearner. learnLabelings(java.util.ArrayList<Labeling> labelings, boolean prune, int threshold)
learn random labelings from the given List until no undecided attacks are left in the theoryMethods in org.tweetyproject.arg.dung.learning that return types with arguments of type DungTheory Modifier and Type Method Description java.util.Map<java.util.Collection<Extension>,java.util.Map<java.util.Collection<Extension>,java.util.Collection<DungTheory>>>
ExampleFinder. getExamples(int minArgs, int maxArgs)
compute a tree like structure of examples.java.util.Map<java.util.Collection<Extension>,java.util.Map<java.util.Collection<Extension>,java.util.Map<java.util.Collection<Extension>,java.util.Collection<DungTheory>>>>
ExtendedExampleFinder. getExamples(int minArgs, int maxArgs)
compute a tree like structure of examples. -
Uses of DungTheory in org.tweetyproject.arg.dung.parser
Methods in org.tweetyproject.arg.dung.parser that return DungTheory Modifier and Type Method Description abstract DungTheory
AbstractDungParser. parse(java.io.Reader reader)
Parses the given file into an abstract argumentation frameworkDungTheory
ApxParser. parse(java.io.Reader reader)
DungTheory
CnfParser. parse(java.io.Reader reader)
DungTheory
TgfParser. parse(java.io.Reader reader)
DungTheory
AbstractDungParser. parseBeliefBase(java.io.Reader reader)
-
Uses of DungTheory in org.tweetyproject.arg.dung.reasoner
Methods in org.tweetyproject.arg.dung.reasoner that return DungTheory Modifier and Type Method Description DungTheory
WeaklyAdmissibleReasoner. getReduct(DungTheory bbase, Extension ext)
computes the reduct of bbase wrt.Methods in org.tweetyproject.arg.dung.reasoner with parameters of type DungTheory Modifier and Type Method Description abstract java.util.Collection<Argument>
AbstractAcceptabilityReasoner. getAcceptableArguments(DungTheory aaf)
Returns the set of acceptable arguments of this reasoner.java.util.Collection<Argument>
EeeAcceptabilityReasoner. getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>
IaqAcceptabilityReasoner. getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>
SeeAcceptabilityReasoner. getAcceptableArguments(DungTheory aaf)
java.util.Collection<Argument>
SeemAcceptabilityReasoner. getAcceptableArguments(DungTheory aaf)
java.util.Set<java.util.Set<Argument>>
WeaklyAdmissibleReasoner. getAttackingCandidates(DungTheory bbase, java.util.Collection<Argument> ext)
computes all conflict-free sets, which attack any argument in extjava.util.Set<Argument>
WeaklyAdmissibleReasoner. getComponent(DungTheory bbase, Argument argument)
finds the set of arguments S = {a | there exists an edge between a and argument}java.util.Set<java.util.Set<Argument>>
WeaklyAdmissibleReasoner. getConflictFreeCandidateSets(DungTheory bbase, java.util.Collection<Argument> candidates)
computes all conflict-free sets of bbase, that contain only arguments in candidates and all arguments are relevant an argument is considered relevant iff it attacks any argument in the same component as the given argument Ajava.util.Set<java.util.Set<Argument>>
WeaklyAdmissibleReasoner. getConflictFreeSets(DungTheory bbase, java.util.Collection<Argument> candidates)
computes all conflict-free sets of bbase, that contain only arguments in candidatesjava.util.Collection<Argument>
OrderingSemanticsReasoner. getConflicts(Extension ext, DungTheory theory)
computes the set of conflicts occurring inside extjava.util.Collection<Argument>
OrderingSemanticsReasoner. getDefendedNotIn(Extension ext, DungTheory theory)
computes the set of arguments outside of ext, which are defended by extjava.util.Collection<Argument>
OrderingSemanticsReasoner. getEmpty(Extension ext, DungTheory theory)
dummy method used if only one ordering semantics is specifiedjava.util.Collection<Extension>
SimpleNaiveReasoner. getMaximalConflictFreeSets(DungTheory bbase, java.util.Collection<Argument> candidates)
computes all maximal conflict-free sets of bbaseabstract Extension
AbstractExtensionReasoner. getModel(DungTheory bbase)
Extension
AbstractSatExtensionReasoner. getModel(DungTheory bbase)
Extension
ProboReasoner. getModel(DungTheory bbase)
Extension
QualifiedReasoner. getModel(DungTheory bbase)
Extension
SccCF2Reasoner. getModel(DungTheory bbase)
Extension
SCF2Reasoner. getModel(DungTheory bbase)
Extension
SCOOCNaiveReasoner. getModel(DungTheory bbase)
Extension
SemiQualifiedReasoner. getModel(DungTheory bbase)
Extension
SimpleAdmissibleReasoner. getModel(DungTheory bbase)
Extension
SimpleCompleteReasoner. getModel(DungTheory bbase)
Extension
SimpleConflictFreeReasoner. getModel(DungTheory bbase)
Extension
SimpleGroundedReasoner. getModel(DungTheory bbase)
Extension
SimpleIdealReasoner. getModel(DungTheory bbase)
Extension
SimpleNaiveReasoner. getModel(DungTheory bbase)
Extension
SimplePreferredReasoner. getModel(DungTheory bbase)
Extension
SimpleSccCompleteReasoner. getModel(DungTheory bbase)
Extension
SimpleSemiStableReasoner. getModel(DungTheory bbase)
Extension
SimpleStableReasoner. getModel(DungTheory bbase)
Extension
SimpleStageReasoner. getModel(DungTheory bbase)
Extension
Stage2Reasoner. getModel(DungTheory bbase)
StratifiedLabeling
StratifiedLabelingReasoner. getModel(DungTheory bbase)
Extension
WeaklyAdmissibleReasoner. getModel(DungTheory bbase)
returns one weakly admissible set of bbaseabstract java.util.Collection<Extension>
AbstractExtensionReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
AbstractSatExtensionReasoner. getModels(DungTheory bbase)
java.util.List<java.util.Collection<java.util.Collection<Argument>>>
OrderingSemanticsReasoner. getModels(DungTheory theory)
compute the ordering over all subsets of theory wrt.java.util.Collection<Extension>
ProboReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
QualifiedReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SccCF2Reasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SCF2Reasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SCOOCNaiveReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SemiQualifiedReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleAdmissibleReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleCompleteReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleConflictFreeReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleGroundedReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleIdealReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleNaiveReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimplePreferredReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleSccCompleteReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleSemiStableReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleStableReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
SimpleStageReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
Stage2Reasoner. getModels(DungTheory bbase)
java.util.Collection<StratifiedLabeling>
StratifiedLabelingReasoner. getModels(DungTheory bbase)
java.util.Collection<Extension>
WeaklyAdmissibleReasoner. getModels(DungTheory bbase)
computes all weakly admissible sets of bbase.PlBeliefSet
AbstractSatExtensionReasoner. getPropositionalCharacterisation(DungTheory aaf)
Creates a propositional representation of the set of labelings of the given Dung theory that are consistent with the given semantics.DungTheory
WeaklyAdmissibleReasoner. getReduct(DungTheory bbase, Extension ext)
computes the reduct of bbase wrt.java.util.Collection<Argument>
OrderingSemanticsReasoner. getUnattacked(Extension ext, DungTheory theory)
computes the set of arguments outside of ext, which are not attacked by extjava.util.Collection<Argument>
OrderingSemanticsReasoner. getUndefended(Extension ext, DungTheory theory)
computes the set of arguments in ext, which are not defended by ext against outside attackersjava.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.void
OrderingSemanticsReasoner. show(DungTheory theory)
print out table showing the sets according to the given ordering semantics -
Uses of DungTheory in org.tweetyproject.arg.dung.semantics
Methods in org.tweetyproject.arg.dung.semantics with parameters of type DungTheory Modifier and Type Method Description boolean
AbstractArgumentationInterpretation. isAcceptable(Argument argument, DungTheory dungTheory)
returns true if every attacker onargument
is attacked by some accepted argument wrt.boolean
AbstractArgumentationInterpretation. isAdmissable(DungTheory dungTheory)
returns true if every accepted argument of this is defended by some accepted argument wrt.boolean
AbstractArgumentationInterpretation. isConflictFree(DungTheory dungTheory)
returns true if no accepted argument attacks another accepted one in this interpretation wrt.boolean
AbstractArgumentationInterpretation. satisfies(DungTheory beliefBase)
boolean
StratifiedLabeling. satisfies(DungTheory beliefBase)
Constructors in org.tweetyproject.arg.dung.semantics with parameters of type DungTheory Constructor Description Labeling(DungTheory theory, Extension ext)
Creates a new labeling from the given extension wrt. -
Uses of DungTheory in org.tweetyproject.arg.dung.syntax
Subclasses of DungTheory in org.tweetyproject.arg.dung.syntax Modifier and Type Class Description class
WeightedDungTheory
Minimalistic Implementation of a weighted argumentation theory used for learning argumentation theories from labelingsMethods in org.tweetyproject.arg.dung.syntax that return DungTheory Modifier and Type Method Description DungTheory
DungTheory. getComplementGraph(int selfloops)
DungTheory
WeightedDungTheory. getDungTheory()
compute Dung Theory only containing attacks with weights greater than zeroDungTheory
WeightedDungTheory. getDungTheory(double threshold)
compute Dung Theory only containing attacks with weight above the given thresholdMethods in org.tweetyproject.arg.dung.syntax with parameters of type DungTheory Modifier and Type Method Description boolean
DungTheory. add(DungTheory theory)
Adds all arguments and attacks of the given theory to this theoryint
DungTheory. compareTo(DungTheory o)
-
Uses of DungTheory in org.tweetyproject.arg.dung.util
Methods in org.tweetyproject.arg.dung.util that return DungTheory Modifier and Type Method Description DungTheory
DefaultDungTheoryGenerator. next()
DungTheory
DefaultDungTheoryGenerator. next(Argument arg)
DungTheory
DungTheoryGenerator. next()
DungTheory
DungTheoryGenerator. next(Argument arg)
Generates a new Dung theory where the given argument is enforced to be in the grounded extensionDungTheory
EnumeratingDungTheoryGenerator. next()
DungTheory
EnumeratingDungTheoryGenerator. next(Argument arg)
DungTheory
FileDungTheoryGenerator. next()
DungTheory
FileDungTheoryGenerator. next(Argument arg)
DungTheory
IsoSafeEnumeratingDungTheoryGenerator. next()
DungTheory
IsoSafeEnumeratingDungTheoryGenerator. next(Argument arg)
DungTheory
PodlaszewskiCaminadaDungTheoryGenerator. next()
DungTheory
PodlaszewskiCaminadaDungTheoryGenerator. next(Argument arg)
Constructor parameters in org.tweetyproject.arg.dung.util with type arguments of type DungTheory Constructor Description FileDungTheoryGenerator(java.io.File[] files, Parser<DungTheory,?> parser, boolean loop)
Creates a new theory generator for the given files, which can be parsed by the given parser. -
Uses of DungTheory in org.tweetyproject.arg.dung.writer
Methods in org.tweetyproject.arg.dung.writer with parameters of type DungTheory Modifier and Type Method Description abstract void
AbstractDungWriter. write(DungTheory aaf, java.io.File f)
Writes the given file into an abstract argumentation frameworkvoid
ApxWriter. write(DungTheory aaf, java.io.File f)
void
CnfWriter. write(DungTheory aaf, java.io.File f)
void
TgfWriter. write(DungTheory aaf, java.io.File f)
-
Uses of DungTheory in org.tweetyproject.arg.prob.analysis
Constructors in org.tweetyproject.arg.prob.analysis with parameters of type DungTheory Constructor Description PAInconsistencyMeasure(RealVectorNorm norm, DungTheory theory, PASemantics semantics)
Creates a new inconsinstency measure which uses the given norm and measures wrt. -
Uses of DungTheory in org.tweetyproject.arg.prob.dynamics
Methods in org.tweetyproject.arg.prob.dynamics with parameters of type DungTheory Modifier and Type Method Description ProbabilisticExtension
AbstractPAChangeOperator. change(ProbabilisticExtension p, DungTheory theory)
abstract ProbabilisticExtension
AbstractPAChangeOperator. change(PartialProbabilityAssignment ppa, DungTheory theory)
ProbabilisticExtension
ChangeOperator. change(ProbabilisticExtension p, DungTheory theory)
Given a probabilistic extension and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state p.ProbabilisticExtension
ChangeOperator. change(PartialProbabilityAssignment ppa, DungTheory theory)
Given a partial probability assignment ppa and an argumentation theory, compute the closest probabilistic extension that is adequate for observing the theory in the state ppa.ProbabilisticExtension
PARevisionOperator. change(PartialProbabilityAssignment ppa, DungTheory theory)
ProbabilisticExtension
PAUpdateOperator. change(PartialProbabilityAssignment ppa, DungTheory theory)
-
Uses of DungTheory in org.tweetyproject.arg.prob.lotteries
Methods in org.tweetyproject.arg.prob.lotteries that return DungTheory Modifier and Type Method Description DungTheory
ArgumentationLottery. getTheory()
Returns the used argumentation theory.DungTheory
LdoArgumentationLottery. getTheory()
Returns the used argumentation theory.DungTheory
SubgraphProbabilityFunction. getTheory()
Returns the theory of this probability function.Methods in org.tweetyproject.arg.prob.lotteries with parameters of type DungTheory Modifier and Type Method Description java.lang.Double
LdoUtilityFunction. getUtility(DungTheory theory, Semantics semantics)
Gets the utility of the given theory wrt.java.lang.Double
UtilityFunction. getUtility(DungTheory theory, Semantics semantics)
Gets the utility of the given theory wrt.SubgraphProbabilityFunction
SubgraphProbabilityFunction. roughUpdate(DungTheory theory)
Updates this probability function with the given theory using "rough redistribution", cf.SubgraphProbabilityFunction
SubgraphProbabilityFunction. simpleUpdate(DungTheory theory)
Updates this probability function with the given theory using "simple redistribution", cf.SubgraphProbabilityFunction
SubgraphProbabilityFunction. stickyUpdate(DungTheory theory, double stickyCoefficient)
Updates this probability function with the given theory using "sticky redistribution", cf.Constructors in org.tweetyproject.arg.prob.lotteries with parameters of type DungTheory Constructor Description SubgraphProbabilityFunction(DungTheory theory)
Creates a new uniform probability function for the given theory, i.e. -
Uses of DungTheory in org.tweetyproject.arg.prob.semantics
Methods in org.tweetyproject.arg.prob.semantics with parameters of type DungTheory Modifier and Type Method Description Extension
ProbabilisticExtension. geLowerCut(DungTheory theory, double delta)
Returns the lower cut of this probabilistic extension wrt.static ProbabilisticExtension
ProbabilisticExtension. getCharacteristicProbabilisticExtension(DungTheory theory, AbstractArgumentationInterpretation i)
Returns the characteristic probabilistic extension of the given interpretation, i.e.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)
Extension
ProbabilisticExtension. getUpperCut(DungTheory theory, double delta)
Returns the upper cut of this probabilistic extension wrt.abstract boolean
AbstractPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
CoherentPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
FoundedPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
InvolutaryPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
JustifiablePASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
NeutralPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
OptimisticPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
PASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
Checks whether the given probabilistic extension satisfies the given argumentation theory wrt.boolean
RationalPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
SemiFoundedPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
boolean
SemiOptimisticPASemantics. satisfies(ProbabilisticExtension p, DungTheory theory)
-
Uses of DungTheory in org.tweetyproject.arg.prob.syntax
Subclasses of DungTheory in org.tweetyproject.arg.prob.syntax Modifier and Type Class Description class
ProbabilisticArgumentationFramework
This class implements the probabilistic argumentation framework approach of [Li, Oren, Norman.Methods in org.tweetyproject.arg.prob.syntax that return DungTheory Modifier and Type Method Description DungTheory
ProbabilisticArgumentationFramework. sample()
Samples a random DungTheory from this framework wrt.Methods in org.tweetyproject.arg.prob.syntax with parameters of type DungTheory Modifier and Type Method Description Probability
ProbabilisticArgumentationFramework. getProbability(DungTheory aaf)
Computes the probability of the given AAF wrt. -
Uses of DungTheory in org.tweetyproject.arg.rankings.reasoner
Methods in org.tweetyproject.arg.rankings.reasoner with parameters of type DungTheory 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.Pair<int[],int[]>
TuplesRankingReasoner. computeTupledValue(Argument a, DungTheory kb)
Computes the tupled value for the given argument.java.util.Collection<Extension>
IteratedGradedDefenseReasoner. getAllMNCompleteExtensions(DungTheory theory, int m, int n)
Returns all mn-complete extensions.java.util.Collection<Extension>
IteratedGradedDefenseReasoner. getAllMNGroundedExtensions(DungTheory theory, int m, int n)
Returns all mn-grounded extensions.java.util.Collection<Extension>
IteratedGradedDefenseReasoner. getAllMNPreferredExtensions(DungTheory theory, int m, int n)
Returns all mn-preferred extensions.java.util.Collection<Extension>
IteratedGradedDefenseReasoner. getAllMStableExtensions(DungTheory theory, int m)
Returns all m-stable extensions.LatticeArgumentRanking
BurdenBasedRankingReasoner. getModel(DungTheory base)
NumericalArgumentRanking
CategorizerRankingReasoner. getModel(DungTheory base)
NumericalArgumentRanking
CountingRankingReasoner. getModel(DungTheory kb)
LatticeArgumentRanking
DiscussionBasedRankingReasoner. getModel(DungTheory kb)
LatticeArgumentRanking
IteratedGradedDefenseReasoner. getModel(DungTheory bbase)
NumericalArgumentRanking
MTRankingReasoner. getModel(DungTheory kb)
NumericalArgumentRanking
ProbabilisticRankingReasoner. getModel(DungTheory aaf)
LatticeArgumentRanking
PropagationRankingReasoner. getModel(DungTheory kb)
NumericalArgumentRanking
SAFRankingReasoner. getModel(DungTheory kb)
LatticeArgumentRanking
TuplesRankingReasoner. getModel(DungTheory kb)
java.util.Collection<LatticeArgumentRanking>
BurdenBasedRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<NumericalArgumentRanking>
CategorizerRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<NumericalArgumentRanking>
CountingRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<LatticeArgumentRanking>
DiscussionBasedRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<LatticeArgumentRanking>
IteratedGradedDefenseReasoner. getModels(DungTheory bbase)
java.util.Collection<NumericalArgumentRanking>
MTRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<NumericalArgumentRanking>
ProbabilisticRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<LatticeArgumentRanking>
PropagationRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<NumericalArgumentRanking>
SAFRankingReasoner. getModels(DungTheory bbase)
java.util.Collection<LatticeArgumentRanking>
TuplesRankingReasoner. getModels(DungTheory bbase)
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.java.util.Collection<Argument>
IteratedGradedDefenseReasoner. gradedDefense(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Implements the graded defense function from Def.java.util.Collection<Argument>
IteratedGradedDefenseReasoner. gradedNeutrality(DungTheory theory, java.util.Collection<Argument> args, int m)
Implements the graded neutrality function from Def.boolean
IteratedGradedDefenseReasoner. isMConflictFree(DungTheory theory, java.util.Collection<Argument> args, int m)
Checks whether the given set of arguments is m-conflict-free, cf.boolean
IteratedGradedDefenseReasoner. isMNAdmissible(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-admissible, cf.boolean
IteratedGradedDefenseReasoner. isMNComplete(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-complete, cf.boolean
IteratedGradedDefenseReasoner. isMNGrounded(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-grounded, cf.boolean
IteratedGradedDefenseReasoner. isMNPreferred(DungTheory theory, java.util.Collection<Argument> args, int m, int n)
Checks whether the given set of arguments is mn-preferred, cf.boolean
IteratedGradedDefenseReasoner. isMStable(DungTheory theory, java.util.Collection<Argument> args, int m)
Checks whether the given set of arguments is m-stable, cf. -
Uses of DungTheory in org.tweetyproject.arg.rankings.util
Methods in org.tweetyproject.arg.rankings.util with parameters of type DungTheory Modifier and Type Method Description static java.util.HashSet<java.util.ArrayList<Argument>>
RankingTools. getPathsOfHigherSize(java.util.HashSet<java.util.ArrayList<Argument>> old_paths, DungTheory base)
Given a set of argument paths of length i-1, this method returns a set of argument paths of length i for the given DungTheory. -
Uses of DungTheory in org.tweetyproject.arg.saf.syntax
Subclasses of DungTheory in org.tweetyproject.arg.saf.syntax Modifier and Type Class Description class
StructuredArgumentationFramework
This class represents a structured argumentation framework, i.e.Methods in org.tweetyproject.arg.saf.syntax that return DungTheory Modifier and Type Method Description DungTheory
StructuredArgumentationFramework. toDungTheory()
Constructs a (pure) Dung theory from this structured argumentation framework. -
Uses of DungTheory in org.tweetyproject.arg.social.syntax
Subclasses of DungTheory in org.tweetyproject.arg.social.syntax Modifier and Type Class Description class
SocialAbstractArgumentationFramework
This class implements a social abstract argumentation framework from [Joao Leite, Joao Martins.Methods in org.tweetyproject.arg.social.syntax with parameters of type DungTheory Modifier and Type Method Description boolean
SocialAbstractArgumentationFramework. add(DungTheory theory)
-