Uses of Class
org.tweetyproject.arg.dung.syntax.DungTheory
Packages that use DungTheory
Package
Description
-
Uses of DungTheory in org.tweetyproject.agents.dialogues
Subclasses of DungTheory in org.tweetyproject.agents.dialoguesModifier and TypeClassDescriptionclassThis class packs a Dung theory into an executable object.Methods in org.tweetyproject.agents.dialogues that return DungTheoryModifier and TypeMethodDescriptionArgumentationEnvironment.getPerceivedDungTheory(Extension<DungTheory> arguments) Returns the view of the universal Dung theory restricted to the given set of arguments.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 DungTheoryModifier and TypeMethodDescriptionArgumentationEnvironment.getDialogueTrace()Returns the current dialogue trace.LotteryArgumentationEnvironment.getDialogueTrace()Returns the current dialogue trace.LotteryArgumentationEnvironment.getDialogueTrace()Returns the current dialogue trace.Method parameters in org.tweetyproject.agents.dialogues with type arguments of type DungTheoryModifier and TypeMethodDescriptionArgumentationEnvironment.getPerceivedDungTheory(Extension<DungTheory> arguments) Returns the view of the universal Dung theory restricted to the given set of arguments.Constructors in org.tweetyproject.agents.dialogues with parameters of type DungTheoryModifierConstructorDescriptionArgumentationEnvironment(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 DungTheoryModifier and TypeMethodDescriptionAbstractLotteryAgent.getTheory()Returns the theory of this agent.ProbabilisticLotteryAgent.getTheory()Returns the theory of this agent.Methods in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheoryModifier and TypeMethodDescriptionabstract doubleAbstractLotteryAgent.getUtility(DungTheory theory, Semantics semantics) Returns the utility of the agent wrt.doubleDummyLotteryAgent.getUtility(DungTheory theory, Semantics semantics) doubleProbabilisticLotteryAgent.getUtility(DungTheory theory, Semantics semantics) doubleRandomLotteryAgent.getUtility(DungTheory theory, Semantics semantics) doubleUtilityBasedLotteryAgent.getUtility(DungTheory theory, Semantics semantics) Constructors in org.tweetyproject.agents.dialogues.lotteries with parameters of type DungTheoryModifierConstructorDescriptionAbstractLotteryAgent(String name, DungTheory theory, Semantics semantics) Creates a new lottery agentDummyLotteryAgent(String name, DungTheory theory, Semantics semantics) LotteryGameSystem(DungTheory universalTheory) Creates a new grounded game system.ProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics) Creates a new lottery agentProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy) Creates a new lottery agentProbabilisticLotteryAgent(String name, DungTheory theory, SubgraphProbabilityFunction prob, UtilityFunction util, Semantics semantics, byte updatestrategy, double stickynesscoefficient) Creates a new lottery agentRandomLotteryAgent(String name, DungTheory theory, UtilityFunction util, Semantics semantics) Creates a new agent with the given name, theory, utility function and semanticsUtilityBasedLotteryAgent(String name, DungTheory theory, UtilityFunction util, Semantics semantics) -
Uses of DungTheory in org.tweetyproject.agents.dialogues.oppmodels
Method parameters in org.tweetyproject.agents.dialogues.oppmodels with type arguments of type DungTheoryModifier and TypeMethodDescriptionT1BeliefState.doMove(ArgumentationEnvironment env, DialogueTrace<Argument, Extension<DungTheory>> trace) doubleGroundedGameUtilityFunction.getUtility(DialogueTrace<Argument, Extension<DungTheory>> trace) doubleGroundedGameUtilityFunction.getUtility(DialogueTrace<Argument, Extension<DungTheory>> trace, Set<Argument> additionalArguments, Set<Attack> additionalAttacks) abstract voidBeliefState.update(DialogueTrace<Argument, Extension<DungTheory>> trace) Updates the current belief state accordingly to the given dialogue trace.voidT1BeliefState.update(DialogueTrace<Argument, Extension<DungTheory>> trace) voidT2BeliefState.update(DialogueTrace<Argument, Extension<DungTheory>> trace) voidT3BeliefState.update(DialogueTrace<Argument, Extension<DungTheory>> trace) Constructors in org.tweetyproject.agents.dialogues.oppmodels with parameters of type DungTheoryModifierConstructorDescriptionGroundedGameSystem(DungTheory universalTheory) Creates a new grounded game system.GroundedGameUtilityFunction(DungTheory theory, Argument argument, GroundedGameSystem.AgentFaction faction) Construct utility function.Constructor parameters in org.tweetyproject.agents.dialogues.oppmodels with type arguments of type DungTheoryModifierConstructorDescriptionBeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new belief-state with the given parameters.BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new belief-state with the given parameters.T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new T1-belief-state with the given parameters and without nesting.T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new T1-belief-state with the given parameters and without nesting.T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, T1BeliefState oppModel) Creates a new T1-belief-state with the given parameters.T1BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, T1BeliefState oppModel) Creates a new T1-belief-state with the given parameters.T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new T2-belief-state with the given parameters and without nesting.T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction) Creates a new T2-belief-state with the given parameters and without nesting.T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, ProbabilityFunction<T2BeliefState> prob) Creates a new T2-belief-state with the given parameters.T2BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, ProbabilityFunction<T2BeliefState> prob) Creates a new T2-belief-state with the given parameters.T3BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, Set<Argument> virtualArguments, Set<Attack> virtualAttacks, RecognitionFunction rec, ProbabilityFunction<T3BeliefState> prob) Creates a new T3-belief-state with the given parameters.T3BeliefState(Extension<DungTheory> knownArguments, UtilityFunction<Argument, Extension<DungTheory>> utilityFunction, Set<Argument> virtualArguments, Set<Attack> virtualAttacks, RecognitionFunction rec, ProbabilityFunction<T3BeliefState> prob) Creates a new T3-belief-state with the given parameters. -
Uses of DungTheory in org.tweetyproject.agents.dialogues.structured
Subclasses of DungTheory in org.tweetyproject.agents.dialogues.structuredModifier and TypeClassDescriptionclassThis 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 -
Uses of DungTheory in org.tweetyproject.arg.aspic.reasoner
Methods in org.tweetyproject.arg.aspic.reasoner that return DungTheoryModifier and TypeMethodDescriptionDirectionalAspicReasoner.asRestrictedDungTheory(AspicArgumentationTheory<T> aat, boolean simplifyArgumentStructure, T conc) Generate restricted AF based on given theory and conclusion.abstract DungTheoryAbstractAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query) Computes the Dung theory from which the answer will be derivedDirectionalAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query) ModuleBasedAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query) RandomAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query) SimpleAspicReasoner.getDungTheory(AspicArgumentationTheory<T> aat, T query) Methods in org.tweetyproject.arg.aspic.reasoner with parameters of type DungTheoryModifier and TypeMethodDescriptionfinal BooleanAbstractAspicReasoner.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 DungTheoryModifier and TypeMethodDescriptionAspicArgumentationTheory.asDungTheory()This method transfers this Aspic+ theory into a Dung style argumentation systemAspicArgumentationTheory.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 DungTheoryModifier and TypeMethodDescriptionDeductiveArgumentationFramework.getCompleteAssociatedDungTheory()constructs the complete associated dung theory of this bipolar argumentation framework i.e.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.Constructor parameters in org.tweetyproject.arg.bipolar.syntax with type arguments of type DungTheory -
Uses of DungTheory in org.tweetyproject.arg.deductive.syntax
Methods in org.tweetyproject.arg.deductive.syntax that return DungTheoryModifier and TypeMethodDescriptionSimplePlLogicDeductiveKnowledgebase.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 DungTheoryModifier and TypeMethodDescriptionDefeasibleLogicProgram.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 DungTheoryModifier and TypeClassDescriptionclassCycleCountInconsistencyMeasure<T extends DungTheory>classDrasticInconsistencyMeasure<T extends DungTheory>interfaceInconsistencyMeasure<T extends DungTheory>classInSumInconsistencyMeasure<T extends DungTheory>classNonGroundedCountInconsistencyMeasure<T extends DungTheory>classPreferredCountInconsistencyMeasure<T extends DungTheory>classUnstableCountInconsistencyMeasure<T extends DungTheory>classclassWeightedCycleCountInconsistencyMeasure<T extends DungTheory>classWeightedInSumInconsistencyMeasure<T extends DungTheory>classWeightedOutSumInconsistencyMeasure<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 DungTheoryModifier and TypeMethodDescriptionDivision.getDividers(DungTheory theory, Semantics semantics) Returns the dividers for this division, i.e.Methods in org.tweetyproject.arg.dung.divisions with parameters of type DungTheoryModifier and TypeMethodDescriptionDivision.getDividers(DungTheory theory, Semantics semantics) Returns the dividers for this division, i.e.static Collection<Division>Division.getDivisions(Collection<Extension<DungTheory>> exts, DungTheory aaf) Returns all divisions of all given extensions and the given aaf.static Collection<Division>Division.getDivisions(Extension<DungTheory> ext, DungTheory aaf) Returns all divisions of aaf that arise from the given extension.static Collection<Division>Division.getStandardDivisions(DungTheory theory) Returns the standard set of divisions of the given argumentation theory, i.e.static booleanDivision.isDisjoint(Collection<Division> divisions, DungTheory theory, Semantics semantics) Checks whether the given set o divisions is disjoint wrt.static booleanDivision.isExhaustive(Collection<Division> divisions, DungTheory theory, Semantics semantics) Checks whether the given set of divisions is exhaustive wrt.Method parameters in org.tweetyproject.arg.dung.divisions with type arguments of type DungTheoryModifier and TypeMethodDescriptionstatic Collection<Division>Division.getDivisions(Collection<Extension<DungTheory>> exts, DungTheory aaf) Returns all divisions of all given extensions and the given aaf.static Collection<Division>Division.getDivisions(Extension<DungTheory> ext, DungTheory aaf) Returns all divisions of aaf that arise from the given extension.booleanDivision.isValid(Collection<Extension<DungTheory>> exts) Checks whether this division is valid wrt.booleanDivision.isValid(Extension<DungTheory> ext) Checks whether this division is valid wrt.Constructor parameters in org.tweetyproject.arg.dung.divisions with type arguments of type DungTheoryModifierConstructorDescriptionDivision(Extension<DungTheory> p, Extension<DungTheory> v) Creates a new division for the given parameters. -
Uses of DungTheory in org.tweetyproject.arg.dung.equivalence
Methods in org.tweetyproject.arg.dung.equivalence that return DungTheoryModifier and TypeMethodDescriptionEquivalenceKernel.getKernel(DungTheory theory) computes the kernel of the given AFMethods in org.tweetyproject.arg.dung.equivalence that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionStrongEquivalence.getStronglyEquivalentTheories(DungTheory theory) compute all strongly equivalent theories for the the given theory i.e.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 DungTheoryModifier and TypeMethodDescriptionEquivalenceKernel.getKernel(DungTheory theory) computes the kernel of the given AFStrongEquivalence.getStronglyEquivalentTheories(DungTheory theory) compute all strongly equivalent theories for the the given theory i.e.StrongEquivalence.getStronglyEquivalentTheoriesNaive(DungTheory baseTheory) compute all strongly equivalent theories for the given theory i.e.AdmissibleKernel.getUselessAttacks(DungTheory theory) CompleteKernel.getUselessAttacks(DungTheory theory) abstract Collection<Attack>EquivalenceKernel.getUselessAttacks(DungTheory theory) compute the set of 'useless' attacks, i.e.GroundedKernel.getUselessAttacks(DungTheory theory) StableKernel.getUselessAttacks(DungTheory theory) booleanStrongEquivalence.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 DungTheoryModifier and TypeMethodDescriptionbooleanStrongEquivalence.isStronglyEquivalent(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 DungTheoryModifier 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 booleanIndependence.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 booleanIndependence.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 disjoint -
Uses of DungTheory in org.tweetyproject.arg.dung.ldo.semantics
Methods in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheoryConstructors in org.tweetyproject.arg.dung.ldo.semantics with parameters of type DungTheoryModifierConstructorDescriptionLdoInterpretation(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 DungTheoryModifier and TypeMethodDescriptionLdoFormula.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 DungTheoryModifier and TypeMethodDescriptionLdoFormula.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 DungTheoryModifier and TypeMethodDescriptionNiskanenTheorySynthesizer.learnExamples(Map<Extension<DungTheory>, Integer> positiveExamples, Map<Extension<DungTheory>, Integer> negativeExamples) learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examplesTheoryLearner.learnExamples(Map<Labeling, Integer> positiveExamples, Map<Labeling, Integer> negativeExamples) learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examplesImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings) learn theory without pruning discarded attacksImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings, boolean prune, int threshold) learn random labelings from the given List until no undecided attacks are left in the theoryRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings) learn theory without pruning discarded attacksRiveretTheoryLearner.learnLabelings(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 DungTheoryModifier and TypeMethodDescriptionMap<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>> ExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>> ExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>> ExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>>> ExtendedExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>>> ExtendedExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>>> ExtendedExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Map<Collection<Extension<DungTheory>>,Map<Collection<Extension<DungTheory>>, Map<Collection<Extension<DungTheory>>, Collection<DungTheory>>>> ExtendedExampleFinder.getExamples(int minArgs, int maxArgs) compute a tree like structure of examples.Method parameters in org.tweetyproject.arg.dung.learning with type arguments of type DungTheoryModifier and TypeMethodDescriptionNiskanenTheorySynthesizer.learnExamples(Map<Extension<DungTheory>, Integer> positiveExamples, Map<Extension<DungTheory>, Integer> negativeExamples) learns an argumentation framework fulfilling as many positive examples as possible while trying to not fulfill any negative examplesvoidExampleFinder.showExamples(Collection<Extension<DungTheory>> extensions) prints a theory for each set of extensions (of the second semantics) that can occur, given the set of extensions for the first semanticsvoidExtendedExampleFinder.showExamples(Collection<Extension<DungTheory>> extensions1, Collection<Extension<DungTheory>> extensions2) prints a theory for each set of extensions (of the third semantics) that can occur, given the set of extensions for the first and second semantics -
Uses of DungTheory in org.tweetyproject.arg.dung.parser
Methods in org.tweetyproject.arg.dung.parser that return DungTheoryModifier and TypeMethodDescriptionabstract DungTheoryParses the given file into an abstract argumentation frameworkAbstractDungParser.parseBeliefBase(Reader reader) static DungTheoryAbstractDungParser.parseJavaStringRepresentation(String str) Parses a representation of the form "\lt; {a,b,c},[(a,b),(b,c)]\gt;" which is given by DungTheory.toString(); -
Uses of DungTheory in org.tweetyproject.arg.dung.reasoner
Methods in org.tweetyproject.arg.dung.reasoner that return DungTheoryModifier and TypeMethodDescriptionWeaklyAdmissibleReasoner.getReduct(DungTheory bbase, Extension<DungTheory> ext) computes the reduct of bbase wrt.Methods in org.tweetyproject.arg.dung.reasoner that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionSimpleResolutionBasedReasoner.computeFRAF(DungTheory start) IncompleteReasoner.getAllModels(IncompleteTheory theory) ExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory) computes the set of conflicts occurring inside extExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are defended by extSimpleNaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates) computes all maximal conflict-free sets of bbaseAbstractSatExtensionReasoner.getModel(DungTheory bbase) ExtensionRankingReasoner.getModel(DungTheory theory) returns the lowest rank of the "getModels" methodQualifiedReasoner.getModel(DungTheory bbase) SccCF2Reasoner.getModel(DungTheory bbase) SCF2Reasoner.getModel(DungTheory bbase) SCOOCNaiveReasoner.getModel(DungTheory bbase) SemiQualifiedReasoner.getModel(DungTheory bbase) SimpleAdmissibleReasoner.getModel(DungTheory bbase) SimpleCompleteReasoner.getModel(DungTheory bbase) SimpleConflictFreeReasoner.getModel(DungTheory bbase) SimpleEagerReasoner.getModel(DungTheory bbase) SimpleGroundedReasoner.getModel(DungTheory bbase) SimpleIdealReasoner.getModel(DungTheory bbase) SimpleInitialReasoner.getModel(DungTheory bbase) SimpleNaiveReasoner.getModel(DungTheory bbase) SimplePreferredReasoner.getModel(DungTheory bbase) SimpleResolutionBasedReasoner.getModel(DungTheory bbase) SimpleSccCompleteReasoner.getModel(DungTheory bbase) SimpleSccRecursiveReasoner.getModel(DungTheory bbase) SimpleSemiStableReasoner.getModel(DungTheory bbase) SimpleStableReasoner.getModel(DungTheory bbase) SimpleStageReasoner.getModel(DungTheory bbase) SolidAdmissibleReasoner.getModel(DungTheory bbase) Stage2Reasoner.getModel(DungTheory bbase) StronglyAdmissibleReasoner.getModel(DungTheory bbase) WeaklyAdmissibleReasoner.getModel(DungTheory bbase) returns one weakly admissible set of bbaseWeaklyCompleteReasoner.getModel(DungTheory bbase) WeaklyGroundedReasoner.getModel(DungTheory bbase) WeaklyPreferredReasoner.getModel(DungTheory bbase) AbstractSatExtensionReasoner.getModels(DungTheory bbase) ExtensionRankingReasoner.getModels(DungTheory theory) compute the ordering over all subsets of theory wrt.ProboReasoner.getModels(DungTheory bbase) QualifiedReasoner.getModels(DungTheory bbase) SccCF2Reasoner.getModels(DungTheory bbase) SCF2Reasoner.getModels(DungTheory bbase) SCOOCNaiveReasoner.getModels(DungTheory bbase) SemiQualifiedReasoner.getModels(DungTheory bbase) SimpleAdmissibleReasoner.getModels(DungTheory bbase) SimpleCompleteReasoner.getModels(DungTheory bbase) SimpleConflictFreeReasoner.getModels(DungTheory bbase) SimpleEagerReasoner.getModels(DungTheory bbase) SimpleGroundedReasoner.getModels(DungTheory bbase) SimpleIdealReasoner.getModels(DungTheory bbase) SimpleInitialReasoner.getModels(DungTheory bbase) SimpleNaiveReasoner.getModels(DungTheory bbase) SimplePreferredReasoner.getModels(DungTheory bbase) SimpleResolutionBasedReasoner.getModels(DungTheory bbase) compute the extension with the base semantics of this.semanticSimpleSccCompleteReasoner.getModels(DungTheory bbase) SimpleSccRecursiveReasoner.getModels(DungTheory bbase) SimpleSemiStableReasoner.getModels(DungTheory bbase) SimpleStableReasoner.getModels(DungTheory bbase) SimpleStageReasoner.getModels(DungTheory bbase) SolidAdmissibleReasoner.getModels(DungTheory bbase) Stage2Reasoner.getModels(DungTheory bbase) StronglyAdmissibleReasoner.getModels(DungTheory bbase) WeaklyAdmissibleReasoner.getModels(DungTheory bbase) computes all weakly admissible sets of bbase.WeaklyCompleteReasoner.getModels(DungTheory bbase) WeaklyGroundedReasoner.getModels(DungTheory bbase) WeaklyPreferredReasoner.getModels(DungTheory bbase) ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are not attacked by extExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments in ext, which are not defended by ext against outside attackersstatic Map<String,Collection<Extension<DungTheory>>> SimpleInitialReasoner.partitionInitialSets(DungTheory theory) Helper function that computed the initial sets of F and labels them in three categoriesMethods in org.tweetyproject.arg.dung.reasoner with parameters of type DungTheoryModifier and TypeMethodDescriptionSimpleResolutionBasedReasoner.computeFRAF(DungTheory start) abstract Collection<Argument>AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf) Returns the set of acceptable arguments of this reasoner.EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf) FudgeAcceptabilityReasoner.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 candidatesExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory) computes the set of conflicts occurring inside extExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are defended by extSimpleNaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates) computes all maximal conflict-free sets of bbaseAbstractSatExtensionReasoner.getModel(DungTheory bbase) ExtensionRankingReasoner.getModel(DungTheory theory) returns the lowest rank of the "getModels" methodProboReasoner.getModel(DungTheory bbase) QualifiedReasoner.getModel(DungTheory bbase) SccCF2Reasoner.getModel(DungTheory bbase) SCF2Reasoner.getModel(DungTheory bbase) SCOOCNaiveReasoner.getModel(DungTheory bbase) SemiQualifiedReasoner.getModel(DungTheory bbase) SimpleAdmissibleReasoner.getModel(DungTheory bbase) SimpleCompleteReasoner.getModel(DungTheory bbase) SimpleConflictFreeReasoner.getModel(DungTheory bbase) SimpleEagerReasoner.getModel(DungTheory bbase) SimpleGroundedReasoner.getModel(DungTheory bbase) SimpleIdealReasoner.getModel(DungTheory bbase) SimpleInitialReasoner.getModel(DungTheory bbase) SimpleNaiveReasoner.getModel(DungTheory bbase) SimplePreferredReasoner.getModel(DungTheory bbase) SimpleResolutionBasedReasoner.getModel(DungTheory bbase) SimpleSccCompleteReasoner.getModel(DungTheory bbase) SimpleSccRecursiveReasoner.getModel(DungTheory bbase) SimpleSemiStableReasoner.getModel(DungTheory bbase) SimpleStableReasoner.getModel(DungTheory bbase) SimpleStageReasoner.getModel(DungTheory bbase) SolidAdmissibleReasoner.getModel(DungTheory bbase) Stage2Reasoner.getModel(DungTheory bbase) StratifiedLabelingReasoner.getModel(DungTheory bbase) StronglyAdmissibleReasoner.getModel(DungTheory bbase) WeaklyAdmissibleReasoner.getModel(DungTheory bbase) returns one weakly admissible set of bbaseWeaklyCompleteReasoner.getModel(DungTheory bbase) WeaklyGroundedReasoner.getModel(DungTheory bbase) WeaklyPreferredReasoner.getModel(DungTheory bbase) AbstractSatExtensionReasoner.getModels(DungTheory bbase) ExtensionRankingReasoner.getModels(DungTheory theory) compute the ordering over all subsets of theory wrt.ProboReasoner.getModels(DungTheory bbase) QualifiedReasoner.getModels(DungTheory bbase) SccCF2Reasoner.getModels(DungTheory bbase) SCF2Reasoner.getModels(DungTheory bbase) SCOOCNaiveReasoner.getModels(DungTheory bbase) SemiQualifiedReasoner.getModels(DungTheory bbase) SimpleAdmissibleReasoner.getModels(DungTheory bbase) SimpleCompleteReasoner.getModels(DungTheory bbase) SimpleConflictFreeReasoner.getModels(DungTheory bbase) SimpleEagerReasoner.getModels(DungTheory bbase) SimpleGroundedReasoner.getModels(DungTheory bbase) SimpleIdealReasoner.getModels(DungTheory bbase) SimpleInitialReasoner.getModels(DungTheory bbase) SimpleNaiveReasoner.getModels(DungTheory bbase) SimplePreferredReasoner.getModels(DungTheory bbase) SimpleResolutionBasedReasoner.getModels(DungTheory bbase) compute the extension with the base semantics of this.semanticSimpleSccCompleteReasoner.getModels(DungTheory bbase) SimpleSccRecursiveReasoner.getModels(DungTheory bbase) SimpleSemiStableReasoner.getModels(DungTheory bbase) SimpleStableReasoner.getModels(DungTheory bbase) SimpleStageReasoner.getModels(DungTheory bbase) SolidAdmissibleReasoner.getModels(DungTheory bbase) Stage2Reasoner.getModels(DungTheory bbase) StratifiedLabelingReasoner.getModels(DungTheory bbase) StronglyAdmissibleReasoner.getModels(DungTheory bbase) WeaklyAdmissibleReasoner.getModels(DungTheory bbase) computes all weakly admissible sets of bbase.WeaklyCompleteReasoner.getModels(DungTheory bbase) WeaklyGroundedReasoner.getModels(DungTheory bbase) WeaklyPreferredReasoner.getModels(DungTheory bbase) 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.WeaklyAdmissibleReasoner.getReduct(DungTheory bbase, Extension<DungTheory> ext) computes the reduct of bbase wrt.SolidAdmissibleReasoner.getSolidlyDefended(Extension<DungTheory> ext, DungTheory theory) ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are not attacked by extExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments in ext, which are not defended by ext against outside attackersbooleanSimpleInitialReasoner.isChallenged(Extension<DungTheory> ext, DungTheory theory) An initial set S is called challenged in F iff there is some other initial set of F which attacks SbooleanSolidAdmissibleReasoner.isSolidlyDefendedBy(Argument arg, Extension<DungTheory> ext, DungTheory theory) booleanSimpleInitialReasoner.isUnattacked(Extension<DungTheory> ext, DungTheory theory) A set S is called unattacked if there is no attacker of S in FbooleanSimpleInitialReasoner.isUnchallenged(Extension<DungTheory> ext, DungTheory theory) An initial set S is called unchallenged in F iff there is no other initial set of F which attacks SbooleanWeaklyCompleteReasoner.isWeaklyDefendedBy(Collection<Argument> X, Collection<Argument> E, DungTheory theory) Computes whether E w-defends X i.e.static Map<String,Collection<Extension<DungTheory>>> SimpleInitialReasoner.partitionInitialSets(DungTheory theory) Helper function that computed the initial sets of F and labels them in three categoriesAbstractAcceptabilityReasoner.query(DungTheory beliefbase, Argument formula) abstract BooleanAbstractDungReasoner.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.Method parameters in org.tweetyproject.arg.dung.reasoner with type arguments of type DungTheoryModifier and TypeMethodDescriptionExtensionRankingReasoner.getConflicts(Extension<DungTheory> ext, DungTheory theory) computes the set of conflicts occurring inside extExtensionRankingReasoner.getDefendedNotIn(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are defended by extWeaklyAdmissibleReasoner.getReduct(DungTheory bbase, Extension<DungTheory> ext) computes the reduct of bbase wrt.SolidAdmissibleReasoner.getSolidlyDefended(Extension<DungTheory> ext, DungTheory theory) ExtensionRankingReasoner.getUnattacked(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments outside of ext, which are not attacked by extExtensionRankingReasoner.getUndefended(Extension<DungTheory> ext, DungTheory theory) computes the set of arguments in ext, which are not defended by ext against outside attackersbooleanSimpleInitialReasoner.isChallenged(Extension<DungTheory> ext, DungTheory theory) An initial set S is called challenged in F iff there is some other initial set of F which attacks SbooleanSolidAdmissibleReasoner.isSolidlyDefendedBy(Argument arg, Extension<DungTheory> ext, DungTheory theory) booleanSimpleInitialReasoner.isUnattacked(Extension<DungTheory> ext, DungTheory theory) A set S is called unattacked if there is no attacker of S in FbooleanSimpleInitialReasoner.isUnchallenged(Extension<DungTheory> ext, DungTheory theory) An initial set S is called unchallenged in F iff there is no other initial set of F which attacks S -
Uses of DungTheory in org.tweetyproject.arg.dung.reasoner.serialisable
Methods in org.tweetyproject.arg.dung.reasoner.serialisable that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionSerialisableExtensionReasoner.getModel(DungTheory bbase) SerialisableExtensionReasoner.getModels(DungTheory bbase) abstract Collection<Extension<DungTheory>>SerialisableExtensionReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) select a subset of the initial sets of the theory, i.e.SerialisedAdmissibleReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) SerialisedGroundedReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) select all unattacked inital singleton-setsSerialisedUnchallengedReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) a selection function that simply returns all unattacked and unchallenged setsMethods in org.tweetyproject.arg.dung.reasoner.serialisable with parameters of type DungTheoryModifier and TypeMethodDescriptionSerialisableExtensionReasoner.getModel(DungTheory bbase) SerialisableExtensionReasoner.getModels(DungTheory bbase) Method parameters in org.tweetyproject.arg.dung.reasoner.serialisable with type arguments of type DungTheoryModifier and TypeMethodDescriptionabstract Collection<Extension<DungTheory>>SerialisableExtensionReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) select a subset of the initial sets of the theory, i.e.SerialisedAdmissibleReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) SerialisedGroundedReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) select all unattacked inital singleton-setsSerialisedUnchallengedReasoner.selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) a selection function that simply returns all unattacked and unchallenged sets -
Uses of DungTheory in org.tweetyproject.arg.dung.semantics
Methods in org.tweetyproject.arg.dung.semantics with parameters of type DungTheory -
Uses of DungTheory in org.tweetyproject.arg.dung.syntax
Subclasses of DungTheory in org.tweetyproject.arg.dung.syntaxModifier and TypeClassDescriptionclassimplements claim based theory see: The Complexity Landscape of Claim-Augmented Argumentation Frameworks (Wolfgang Dvoˇr´ak Alexander Greßler Anna Rapberger StefanWoltran )classclassMinimalistic Implementation of a weighted argumentation theory used for learning argumentation theories from labelingsMethods in org.tweetyproject.arg.dung.syntax that return DungTheoryModifier and TypeMethodDescriptionDungTheory.clone()DungTheory.getComplementGraph(int selfloops) WeightedDungTheory.getDungTheory()compute Dung Theory only containing attacks with weights greater than zeroWeightedDungTheory.getDungTheory(double threshold) compute Dung Theory only containing attacks with weight above the given thresholdTransitionState.getTheory()Methods in org.tweetyproject.arg.dung.syntax that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionDungTheory.faf(Extension<DungTheory> extension) The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt.TransitionState.getExtension()Methods in org.tweetyproject.arg.dung.syntax with parameters of type DungTheoryModifier and TypeMethodDescriptionbooleanDungTheory.add(DungTheory theory) Adds all arguments and attacks of the given theory to this theoryintDungTheory.compareTo(DungTheory o) Method parameters in org.tweetyproject.arg.dung.syntax with type arguments of type DungTheoryModifier and TypeMethodDescriptionDungTheory.faf(Extension<DungTheory> extension) The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt.ClaimBasedTheory.getClaims(Extension<DungTheory> ext) get all claims of a given extensionTransitionState.getNext(Extension<DungTheory> ext) compute the successor state for the given extensionbooleanDungTheory.isAcceptable(Argument argument, Extension<DungTheory> ext) returns true if every attacker onargumentis attacked by some accepted argument wrt.booleanDungTheory.isAdmissable(Extension<DungTheory> ext) booleanDungTheory.isAttacked(Extension<DungTheory> ext1, Extension<DungTheory> ext2) returns true if some argument ofext2attacks some argument inext1booleanDungTheory.isConflictFree(Extension<DungTheory> ext) booleanDungTheory.isStable(Extension<DungTheory> e) Checks whether the given extension is stable wrt.voidIncompleteTheory.merge(HashSet<DungTheory> theories) merges DungTheories to one incomplete theoryConstructors in org.tweetyproject.arg.dung.syntax with parameters of type DungTheoryModifierConstructorDescriptionTransitionState(DungTheory theory, Extension<DungTheory> extension) Constructor parameters in org.tweetyproject.arg.dung.syntax with type arguments of type DungTheoryModifierConstructorDescriptionTransitionState(DungTheory theory, Extension<DungTheory> extension) -
Uses of DungTheory in org.tweetyproject.arg.dung.util
Methods in org.tweetyproject.arg.dung.util that return DungTheoryModifier and TypeMethodDescriptionDefaultDungTheoryGenerator.next()DungTheoryGenerator.next()Generates a new Dung theory where the given argument is enforced to be in the grounded extensionEnumeratingDungTheoryGenerator.next()FileDungTheoryGenerator.next()IsoSafeEnumeratingDungTheoryGenerator.next()KwtDungTheoryGenerator.next()PodlaszewskiCaminadaDungTheoryGenerator.next()Constructor parameters in org.tweetyproject.arg.dung.util with type arguments of type DungTheoryModifierConstructorDescriptionFileDungTheoryGenerator(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 DungTheoryModifier and TypeMethodDescriptionabstract voidAbstractDungWriter.write(DungTheory aaf, File f) Writes the given file into an abstract argumentation frameworkvoidApxWriter.write(DungTheory aaf, File f) voidCnfWriter.write(DungTheory aaf, File f) voidTgfWriter.write(DungTheory aaf, File f) -
Uses of DungTheory in org.tweetyproject.arg.prob.analysis
Constructors in org.tweetyproject.arg.prob.analysis with parameters of type DungTheoryModifierConstructorDescriptionPAInconsistencyMeasure(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 DungTheoryModifier and TypeMethodDescriptionAbstractPAChangeOperator.change(ProbabilisticExtension p, DungTheory theory) abstract ProbabilisticExtensionAbstractPAChangeOperator.change(PartialProbabilityAssignment ppa, DungTheory theory) 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.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.PARevisionOperator.change(PartialProbabilityAssignment ppa, DungTheory theory) PAUpdateOperator.change(PartialProbabilityAssignment ppa, DungTheory theory) -
Uses of DungTheory in org.tweetyproject.arg.prob.lotteries
Methods in org.tweetyproject.arg.prob.lotteries that return DungTheoryModifier and TypeMethodDescriptionArgumentationLottery.getTheory()Returns the used argumentation theory.LdoArgumentationLottery.getTheory()Returns the used argumentation theory.SubgraphProbabilityFunction.getTheory()Returns the theory of this probability function.Methods in org.tweetyproject.arg.prob.lotteries with parameters of type DungTheoryModifier and TypeMethodDescriptionLdoUtilityFunction.getUtility(DungTheory theory, Semantics semantics) Gets the utility of the given theory wrt.UtilityFunction.getUtility(DungTheory theory, Semantics semantics) Gets the utility of the given theory wrt.SubgraphProbabilityFunction.roughUpdate(DungTheory theory) Updates this probability function with the given theory using "rough redistribution", cf.SubgraphProbabilityFunction.simpleUpdate(DungTheory theory) Updates this probability function with the given theory using "simple redistribution", cf.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 DungTheoryModifierConstructorDescriptionCreates 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 that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionProbabilisticExtension.geLowerCut(DungTheory theory, double delta) Returns the lower cut of this probabilistic extension wrt.ProbabilisticExtension.getAllArguments()Returns the set of all arguments appearing.ProbabilisticExtension.getUpperCut(DungTheory theory, double delta) Returns the upper cut of this probabilistic extension wrt.Methods in org.tweetyproject.arg.prob.semantics with parameters of type DungTheoryModifier and TypeMethodDescriptionProbabilisticExtension.geLowerCut(DungTheory theory, double delta) Returns the lower cut of this probabilistic extension wrt.static ProbabilisticExtensionProbabilisticExtension.getCharacteristicProbabilisticExtension(DungTheory theory, AbstractArgumentationInterpretation i) Returns the characteristic probabilistic extension of the given interpretation, i.e.abstract 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) ProbabilisticExtension.getUpperCut(DungTheory theory, double delta) Returns the upper cut of this probabilistic extension wrt.abstract booleanAbstractPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanCoherentPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanFoundedPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanInvolutaryPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanJustifiablePASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanNeutralPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanOptimisticPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) Checks whether the given probabilistic extension satisfies the given argumentation theory wrt.booleanRationalPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanSemiFoundedPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) booleanSemiOptimisticPASemantics.satisfies(ProbabilisticExtension p, DungTheory theory) -
Uses of DungTheory in org.tweetyproject.arg.prob.syntax
Subclasses of DungTheory in org.tweetyproject.arg.prob.syntaxModifier and TypeClassDescriptionclassThis class implements the probabilistic argumentation framework approach of [Li, Oren, Norman.Methods in org.tweetyproject.arg.prob.syntax that return DungTheoryModifier and TypeMethodDescriptionProbabilisticArgumentationFramework.sample()Samples a random DungTheory from this framework wrt.Methods in org.tweetyproject.arg.prob.syntax with parameters of type DungTheoryModifier and TypeMethodDescriptionProbabilisticArgumentationFramework.getProbability(DungTheory aaf) Computes the probability of the given AAF wrt. -
Uses of DungTheory in org.tweetyproject.arg.rankings.postulates
Method parameters in org.tweetyproject.arg.rankings.postulates with type arguments of type DungTheoryModifier and TypeMethodDescriptionbooleanRaAbstraction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaAdditionOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaAttackVsFullDefense.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaCardinalityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaDistDefensePrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaIncreaseOfAttackBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaIncreaseOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaIndependence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) abstract booleanRankingPostulate.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaNonAttackedEquivalence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaQualityPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaSelfContradiction.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaStrictAdditionOfDefenseBranch.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaStrictCounterTransitivity.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaTotal.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) booleanRaVoidPrecedence.isSatisfied(Collection<Argument> kb, AbstractRankingReasoner<GeneralComparator<Argument, DungTheory>> ev) -
Uses of DungTheory in org.tweetyproject.arg.rankings.reasoner
Classes in org.tweetyproject.arg.rankings.reasoner with type parameters of type DungTheoryModifier and TypeClassDescriptionclassAbstractRankingReasoner<R extends GeneralComparator<Argument,DungTheory>> Common abstract class for ranking reasoners for abstract argumentation.Methods in org.tweetyproject.arg.rankings.reasoner that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionCounterTransitivityReasoner.cardinality(DungTheory af) orders arguments after the amount of attackers they have.CounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the cardinality function.IteratedGradedDefenseReasoner.getAllMNCompleteExtensions(DungTheory theory, int m, int n) Returns all mn-complete extensions.IteratedGradedDefenseReasoner.getAllMNGroundedExtensions(DungTheory theory, int m, int n) Returns all mn-grounded extensions.IteratedGradedDefenseReasoner.getAllMNPreferredExtensions(DungTheory theory, int m, int n) Returns all mn-preferred extensions.IteratedGradedDefenseReasoner.getAllMStableExtensions(DungTheory theory, int m) Returns all m-stable extensions.BurdenBasedRankingReasoner.getModel(DungTheory base) CategorizerRankingReasoner.getModel(DungTheory base) CounterTransitivityReasoner.getModel(DungTheory bbase) CountingRankingReasoner.getModel(DungTheory kb) DiscussionBasedRankingReasoner.getModel(DungTheory kb) IteratedGradedDefenseReasoner.getModel(DungTheory bbase) ProbabilisticRankingReasoner.getModel(DungTheory aaf) PropagationRankingReasoner.getModel(DungTheory kb) SAFRankingReasoner.getModel(DungTheory kb) StrategyBasedRankingReasoner.getModel(DungTheory kb) TuplesRankingReasoner.getModel(DungTheory kb) BurdenBasedRankingReasoner.getModels(DungTheory bbase) CategorizerRankingReasoner.getModels(DungTheory bbase) CounterTransitivityReasoner.getModels(DungTheory bbase) CountingRankingReasoner.getModels(DungTheory bbase) DiscussionBasedRankingReasoner.getModels(DungTheory bbase) IteratedGradedDefenseReasoner.getModels(DungTheory bbase) ProbabilisticRankingReasoner.getModels(DungTheory bbase) PropagationRankingReasoner.getModels(DungTheory bbase) SAFRankingReasoner.getModels(DungTheory bbase) StrategyBasedRankingReasoner.getModels(DungTheory bbase) TuplesRankingReasoner.getModels(DungTheory bbase) CounterTransitivityReasoner.gfpCardinality(DungTheory af) calculates the greatest fix point.CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to a given ranking.CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the quality function.CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) only ranks two arguments if one is better according to quality and cardinalityMethods in org.tweetyproject.arg.rankings.reasoner with parameters of type DungTheoryModifier and TypeMethodDescriptionCounterTransitivityReasoner.cardinality(DungTheory af) orders arguments after the amount of attackers they have.CounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the cardinality function.doubleStrategyBasedRankingReasoner.computeDegreeOfAcceptability(Collection<Argument> A, Collection<Argument> B, DungTheory kb) Computes the degree of acceptability of the strategy A wrt.doubleStrategyBasedRankingReasoner.computeRewards(Collection<Argument> A, Collection<Argument> B, DungTheory kb) Computes the rewards of the given strategy (set of arguments).doubleStrategyBasedRankingReasoner.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.IteratedGradedDefenseReasoner.getAllMNCompleteExtensions(DungTheory theory, int m, int n) Returns all mn-complete extensions.IteratedGradedDefenseReasoner.getAllMNGroundedExtensions(DungTheory theory, int m, int n) Returns all mn-grounded extensions.IteratedGradedDefenseReasoner.getAllMNPreferredExtensions(DungTheory theory, int m, int n) Returns all mn-preferred extensions.IteratedGradedDefenseReasoner.getAllMStableExtensions(DungTheory theory, int m) Returns all m-stable extensions.BurdenBasedRankingReasoner.getModel(DungTheory base) CategorizerRankingReasoner.getModel(DungTheory base) CounterTransitivityReasoner.getModel(DungTheory bbase) CountingRankingReasoner.getModel(DungTheory kb) DiscussionBasedRankingReasoner.getModel(DungTheory kb) IteratedGradedDefenseReasoner.getModel(DungTheory bbase) ProbabilisticRankingReasoner.getModel(DungTheory aaf) PropagationRankingReasoner.getModel(DungTheory kb) SAFRankingReasoner.getModel(DungTheory kb) StrategyBasedRankingReasoner.getModel(DungTheory kb) TuplesRankingReasoner.getModel(DungTheory kb) BurdenBasedRankingReasoner.getModels(DungTheory bbase) CategorizerRankingReasoner.getModels(DungTheory bbase) CounterTransitivityReasoner.getModels(DungTheory bbase) CountingRankingReasoner.getModels(DungTheory bbase) DiscussionBasedRankingReasoner.getModels(DungTheory bbase) IteratedGradedDefenseReasoner.getModels(DungTheory bbase) ProbabilisticRankingReasoner.getModels(DungTheory bbase) PropagationRankingReasoner.getModels(DungTheory bbase) SAFRankingReasoner.getModels(DungTheory bbase) StrategyBasedRankingReasoner.getModels(DungTheory bbase) TuplesRankingReasoner.getModels(DungTheory bbase) intDiscussionBasedRankingReasoner.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.CounterTransitivityReasoner.gfpCardinality(DungTheory af) calculates the greatest fix point.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.booleanIteratedGradedDefenseReasoner.isMConflictFree(DungTheory theory, Collection<Argument> args, int m) Checks whether the given set of arguments is m-conflict-free, cf.booleanIteratedGradedDefenseReasoner.isMNAdmissible(DungTheory theory, Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-admissible, cf.booleanIteratedGradedDefenseReasoner.isMNComplete(DungTheory theory, Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-complete, cf.booleanIteratedGradedDefenseReasoner.isMNGrounded(DungTheory theory, Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-grounded, cf.booleanIteratedGradedDefenseReasoner.isMNPreferred(DungTheory theory, Collection<Argument> args, int m, int n) Checks whether the given set of arguments is mn-preferred, cf.booleanIteratedGradedDefenseReasoner.isMStable(DungTheory theory, Collection<Argument> args, int m) Checks whether the given set of arguments is m-stable, cf.CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to a given ranking.CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the quality function.CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) only ranks two arguments if one is better according to quality and cardinalityMethod parameters in org.tweetyproject.arg.rankings.reasoner with type arguments of type DungTheoryModifier and TypeMethodDescriptionCounterTransitivityReasoner.cardinalityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the cardinality function.CounterTransitivityReasoner.quality(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to a given ranking.CounterTransitivityReasoner.qualityFirst(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) ranks arguments according to the quality function.CounterTransitivityReasoner.simpleDominance(DungTheory af, LatticePartialOrder<Argument, DungTheory> ra) only ranks two arguments if one is better according to quality and cardinalityConstructor parameters in org.tweetyproject.arg.rankings.reasoner with type arguments of type DungTheoryModifierConstructorDescriptionCounterTransitivityReasoner(CounterTransitivityReasoner.solver sol, LatticePartialOrder<Argument, DungTheory> rank) -
Uses of DungTheory in org.tweetyproject.arg.rankings.util
Methods in org.tweetyproject.arg.rankings.util that return types with arguments of type DungTheoryModifier and TypeMethodDescriptionstatic GeneralComparator<Argument,DungTheory> RankingTools.roundRanking(NumericalPartialOrder<Argument, DungTheory> ranking, int n) Rounds values in the given numerical argument ranking to n decimals.Methods in org.tweetyproject.arg.rankings.util with parameters of type DungTheoryModifier 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.Method parameters in org.tweetyproject.arg.rankings.util with type arguments of type DungTheoryModifier and TypeMethodDescriptionstatic GeneralComparator<Argument,DungTheory> RankingTools.roundRanking(NumericalPartialOrder<Argument, DungTheory> ranking, int n) Rounds values in the given numerical argument ranking to n decimals. -
Uses of DungTheory in org.tweetyproject.arg.saf.syntax
Subclasses of DungTheory in org.tweetyproject.arg.saf.syntaxModifier and TypeClassDescriptionclassThis class represents a structured argumentation framework, i.e.Methods in org.tweetyproject.arg.saf.syntax that return DungTheoryModifier and TypeMethodDescriptionStructuredArgumentationFramework.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.syntaxModifier and TypeClassDescriptionclassThis class implements a social abstract argumentation framework from [Joao Leite, Joao Martins.Methods in org.tweetyproject.arg.social.syntax with parameters of type DungTheoryModifier and TypeMethodDescriptionbooleanSocialAbstractArgumentationFramework.add(DungTheory theory)