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

Packages that use DungTheory

Package	Description
net.sf.tweety.arg.dung.analysis
net.sf.tweety.arg.dung.divisions
net.sf.tweety.arg.dung.ldo.semantics
net.sf.tweety.arg.dung.ldo.syntax
net.sf.tweety.arg.dung.learning
net.sf.tweety.arg.dung.parser
net.sf.tweety.arg.dung.reasoner
net.sf.tweety.arg.dung.semantics
net.sf.tweety.arg.dung.syntax
net.sf.tweety.arg.dung.util
net.sf.tweety.arg.dung.writer

Uses of DungTheory in net.sf.tweety.arg.dung.analysis

Classes in net.sf.tweety.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 net.sf.tweety.arg.dung.divisions

Methods in net.sf.tweety.arg.dung.divisions that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	Division.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this division, i.e.

Methods in net.sf.tweety.arg.dung.divisions with parameters of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	Division.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this division, i.e.
static Collection<Division>	Division.getDivisions(Collection<Extension> exts, DungTheory aaf)	Returns all divisions of all given extensions and the given aaf.
static Collection<Division>	Division.getDivisions(Extension 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 boolean	Division.isDisjoint(Collection<Division> divisions, DungTheory theory, Semantics semantics)	Checks whether the given set o divisions is disjoint wrt.
static boolean	Division.isExhaustive(Collection<Division> divisions, DungTheory theory, Semantics semantics)	Checks whether the given set of divisions is exhaustive wrt.

Uses of DungTheory in net.sf.tweety.arg.dung.ldo.semantics

Methods in net.sf.tweety.arg.dung.ldo.semantics with parameters of type DungTheory

Modifier and Type	Method	Description
boolean	LdoInterpretation.satisfies(DungTheory beliefBase)

Constructors in net.sf.tweety.arg.dung.ldo.semantics with parameters of type DungTheory

Constructor	Description
LdoInterpretation(DungTheory theory, Extension ext, Semantics semantics)	Creates a new interpretation
LdoInterpretation(DungTheory theory, Semantics semantics)	Creates a new interpretation

Uses of DungTheory in net.sf.tweety.arg.dung.ldo.syntax

Methods in net.sf.tweety.arg.dung.ldo.syntax that return types with arguments of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	LdoFormula.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this formula, i.e.

Methods in net.sf.tweety.arg.dung.ldo.syntax with parameters of type DungTheory

Modifier and Type	Method	Description
Collection<DungTheory>	LdoFormula.getDividers(DungTheory theory, Semantics semantics)	Returns the dividers for this formula, i.e.

Uses of DungTheory in net.sf.tweety.arg.dung.learning

Methods in net.sf.tweety.arg.dung.learning that return DungTheory

Modifier and Type	Method	Description
DungTheory	ImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings)	learn theory without pruning discarded attacks
DungTheory	ImprovedRiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings, boolean prune, int threshold)	learn random labelings from the given List until no undecided attacks are left in the theory
DungTheory	RiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings)	learn theory without pruning discarded attacks
DungTheory	RiveretTheoryLearner.learnLabelings(ArrayList<Labeling> labelings, boolean prune)	learn random labelings from the given List until no undecided attacks are left in the theory

Uses of DungTheory in net.sf.tweety.arg.dung.parser

Methods in net.sf.tweety.arg.dung.parser that return DungTheory

Modifier and Type	Method	Description
abstract DungTheory	AbstractDungParser.parse(Reader reader)	Parses the given file into an abstract argumentation framework
DungTheory	ApxParser.parse(Reader reader)
DungTheory	CnfParser.parse(Reader reader)
DungTheory	TgfParser.parse(Reader reader)
DungTheory	AbstractDungParser.parseBeliefBase(Reader reader)

Uses of DungTheory in net.sf.tweety.arg.dung.reasoner

Methods in net.sf.tweety.arg.dung.reasoner that return DungTheory

Modifier and Type	Method	Description
DungTheory	OrderingSemanticsReasoner.getModels(DungTheory theory)	compute a meta graph for the ordering of the subsets over the given theory
DungTheory	WeaklyAdmissibleReasoner.getReduct(DungTheory bbase, Extension ext)	computes the reduct of bbase wrt.

Methods in net.sf.tweety.arg.dung.reasoner with parameters of type DungTheory

Modifier and Type	Method	Description
abstract Collection<Argument>	AbstractAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)	Returns the set of acceptable arguments of this reasoner.
Collection<Argument>	EeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	IaqAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeeAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
Collection<Argument>	SeemAcceptabilityReasoner.getAcceptableArguments(DungTheory aaf)
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttacked(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacked by an element of arguments in bbase
protected Collection<Argument>	WeaklyAdmissibleReasoner.getAttackers(DungTheory bbase, Collection<Argument> arguments)	computes the set of arguments attacking an element of arguments in bbase
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getAttackingCandidates(DungTheory bbase, Collection<Argument> ext)	computes all conflict-free sets, which attack any argument in ext
Set<Argument>	WeaklyAdmissibleReasoner.getComponent(DungTheory bbase, Argument argument)	finds the set of arguments S = {a | there exists an edge between a and argument}
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeCandidateSets(DungTheory bbase, Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates and all arguments are relevant an argument is considered relevant iff it attacks any argument in the same component as the given argument A
Set<Set<Argument>>	WeaklyAdmissibleReasoner.getConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all conflict-free sets of bbase, that contain only arguments in candidates
Collection<Argument>	OrderingSemanticsReasoner.getConflicts(Extension ext, DungTheory theory)	computes the set of conflicts occurring inside ext
Collection<Argument>	OrderingSemanticsReasoner.getDefendedNotIn(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are defended by ext
Collection<Argument>	OrderingSemanticsReasoner.getEmpty(Extension ext, DungTheory theory)	dummy method used if only one ordering semantics is specified
Collection<Extension>	NaiveReasoner.getMaximalConflictFreeSets(DungTheory bbase, Collection<Argument> candidates)	computes all maximal conflict-free sets of bbase
abstract Extension	AbstractExtensionReasoner.getModel(DungTheory bbase)
Extension	AbstractSatExtensionReasoner.getModel(DungTheory bbase)
Extension	NaiveReasoner.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	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 bbase
abstract Collection<Extension>	AbstractExtensionReasoner.getModels(DungTheory bbase)
Collection<Extension>	AbstractSatExtensionReasoner.getModels(DungTheory bbase)
Collection<Extension>	NaiveReasoner.getModels(DungTheory bbase)
DungTheory	OrderingSemanticsReasoner.getModels(DungTheory theory)	compute a meta graph for the ordering of the subsets over the given theory
Collection<Extension>	ProboReasoner.getModels(DungTheory bbase)
Collection<Extension>	QualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension>	SccCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension>	SCF2Reasoner.getModels(DungTheory bbase)
Collection<Extension>	SCOOCNaiveReasoner.getModels(DungTheory bbase)
Collection<Extension>	SemiQualifiedReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleAdmissibleReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleConflictFreeReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleGroundedReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleIdealReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimplePreferredReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleSccCompleteReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleSemiStableReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleStableReasoner.getModels(DungTheory bbase)
Collection<Extension>	SimpleStageReasoner.getModels(DungTheory bbase)
Collection<Extension>	Stage2Reasoner.getModels(DungTheory bbase)
Collection<StratifiedLabeling>	StratifiedLabelingReasoner.getModels(DungTheory bbase)
Collection<Extension>	WeaklyAdmissibleReasoner.getModels(DungTheory bbase)	computes all weakly admissible sets of bbase.
net.sf.tweety.logics.pl.syntax.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.
protected abstract net.sf.tweety.logics.pl.syntax.PlBeliefSet	AbstractSatExtensionReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)	Returns the semantic-specific propositional characterization of the underlying Dung theory, see getPropositionalCharacterisation.
protected net.sf.tweety.logics.pl.syntax.PlBeliefSet	SatCompleteReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
protected net.sf.tweety.logics.pl.syntax.PlBeliefSet	SatStableReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> in, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> out, Map<Argument,net.sf.tweety.logics.pl.syntax.Proposition> undec)
DungTheory	WeaklyAdmissibleReasoner.getReduct(DungTheory bbase, Extension ext)	computes the reduct of bbase wrt.
Collection<Argument>	OrderingSemanticsReasoner.getUnattacked(Extension ext, DungTheory theory)	computes the set of arguments outside of ext, which are not attacked by ext
Collection<Argument>	OrderingSemanticsReasoner.getUndefended(Extension ext, DungTheory theory)	computes the set of arguments in ext, which are not defended by ext against outside attackers
protected boolean	WeaklyAdmissibleReasoner.isWeaklyAdmissible(DungTheory bbase, Extension ext)	checks whether ext is weakly admissible in bbase
Boolean	AbstractAcceptabilityReasoner.query(DungTheory beliefbase, Argument formula)
abstract Boolean	AbstractDungReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	AbstractExtensionReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
Boolean	ProboReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)
Boolean	SatCompleteReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula)
Boolean	StratifiedLabelingReasoner.query(DungTheory beliefbase, Argument formula, net.sf.tweety.commons.InferenceMode inferenceMode)	Queries the given AAF for the given argument using the given inference type.
void	OrderingSemanticsReasoner.show(DungTheory theory)	print out table showing the sets according to the given ordering semantics

Uses of DungTheory in net.sf.tweety.arg.dung.semantics

Methods in net.sf.tweety.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 on argument 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 net.sf.tweety.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 net.sf.tweety.arg.dung.syntax

Subclasses of DungTheory in net.sf.tweety.arg.dung.syntax

Modifier and Type	Class	Description
class	WeightedDungTheory	Minimalistic Implementation of a weighted argumentation theory used for learning argumentation theories from labelings

Methods in net.sf.tweety.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 zero
DungTheory	WeightedDungTheory.getDungTheory(double threshold)	compute Dung Theory only containing attacks with weight above the given threshold

Methods in net.sf.tweety.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 theory
int	DungTheory.compareTo(DungTheory o)

Uses of DungTheory in net.sf.tweety.arg.dung.util

Methods in net.sf.tweety.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 extension
DungTheory	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 net.sf.tweety.arg.dung.util with type arguments of type DungTheory

Constructor	Description
FileDungTheoryGenerator(File[] files, net.sf.tweety.commons.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 net.sf.tweety.arg.dung.writer

Methods in net.sf.tweety.arg.dung.writer with parameters of type DungTheory

Modifier and Type	Method	Description
abstract void	AbstractDungWriter.write(DungTheory aaf, File f)	Writes the given file into an abstract argumentation framework
void	ApxWriter.write(DungTheory aaf, File f)
void	CnfWriter.write(DungTheory aaf, File f)
void	TgfWriter.write(DungTheory aaf, File f)