Modifier and Type | Class and Description |
---|---|
class |
ExecutableDungTheory
This class packs a Dung theory into an executable object.
|
Modifier and Type | Field and Description |
---|---|
private DungTheory |
LotteryArgumentationEnvironment.universalTheory
The universal Dung theory used for argumentation.
|
private DungTheory |
ArgumentationEnvironment.universalTheory
The universal Dung theory used for argumentation.
|
Modifier and Type | Field and Description |
---|---|
private DialogueTrace<DungTheory,java.util.Collection<DungTheory>> |
LotteryArgumentationEnvironment.trace
The current dialogue trace.
|
private DialogueTrace<DungTheory,java.util.Collection<DungTheory>> |
LotteryArgumentationEnvironment.trace
The current dialogue trace.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
LotteryArgumentationEnvironment.getPerceivedDungTheory(Extension arguments)
Returns the view of the universal Dung theory restricted to
the given set of arguments.
|
DungTheory |
ArgumentationEnvironment.getPerceivedDungTheory(Extension arguments)
Returns the view of the universal Dung theory restricted to
the given set of arguments.
|
Modifier and Type | Method and 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.
|
Constructor and 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.
|
Modifier and Type | Field and Description |
---|---|
protected DungTheory |
AbstractLotteryAgent.theory
The theory of this agent.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
ProbabilisticLotteryAgent.getTheory()
Returns the theory of this agent.
|
DungTheory |
AbstractLotteryAgent.getTheory()
Returns the theory of this agent.
|
Modifier and Type | Method and Description |
---|---|
double |
UtilityBasedLotteryAgent.getUtility(DungTheory theory,
Semantics semantics) |
double |
RandomLotteryAgent.getUtility(DungTheory theory,
Semantics semantics) |
double |
ProbabilisticLotteryAgent.getUtility(DungTheory theory,
Semantics semantics) |
double |
DummyLotteryAgent.getUtility(DungTheory theory,
Semantics semantics) |
abstract double |
AbstractLotteryAgent.getUtility(DungTheory theory,
Semantics semantics)
Returns the utility of the agent wrt.
|
Constructor and Description |
---|
AbstractLotteryAgent(java.lang.String name,
DungTheory theory,
Semantics semantics)
Creates a new lottery agent
|
DummyLotteryAgent(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 agent
|
ProbabilisticLotteryAgent(java.lang.String name,
DungTheory theory,
SubgraphProbabilityFunction prob,
UtilityFunction util,
Semantics semantics,
byte updatestrategy)
Creates a new lottery agent
|
ProbabilisticLotteryAgent(java.lang.String name,
DungTheory theory,
SubgraphProbabilityFunction prob,
UtilityFunction util,
Semantics semantics,
byte updatestrategy,
double stickynesscoefficient)
Creates a new lottery agent
|
RandomLotteryAgent(java.lang.String name,
DungTheory theory,
UtilityFunction util,
Semantics semantics)
Creates a new agent with the given name, theory, and semantics
|
UtilityBasedLotteryAgent(java.lang.String name,
DungTheory theory,
UtilityFunction util,
Semantics semantics) |
Modifier and Type | Field and Description |
---|---|
private DungTheory |
GroundedGameUtilityFunction.theory
The underlying Dung theory
|
Constructor and Description |
---|
GroundedGameSystem(DungTheory universalTheory)
Creates a new grounded game system.
|
GroundedGameUtilityFunction(DungTheory theory,
Argument argument,
GroundedGameSystem.AgentFaction faction)
Construct utility function.
|
Modifier and Type | Class and Description |
---|---|
class |
PerceivableStructuredArgumentationFramework
This class packs a structured argumentation framework into a
perceivable object.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
ABATheory.asDungTheory() |
Modifier and Type | Method and Description |
---|---|
DungTheory |
AspicArgumentationTheory.asDungTheory()
This method transfers this Aspic+ theory into a Dung style srhumentation system
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
DefeasibleLogicProgram.getDungTheory()
This method translates this delp into an abstract Dung theory.
|
Modifier and Type | Field and Description |
---|---|
private static java.util.Map<DungTheory,java.util.Collection<Graph<Argument>>> |
DungTheory.archivedSubgraphs
For archiving sub graphs
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
DungTheory.getComplementGraph(int selfloops) |
Modifier and Type | Method and Description |
---|---|
boolean |
DungTheory.add(DungTheory theory)
Adds all arguments and attacks of the given theory to
this theory
|
int |
DungTheory.compareTo(DungTheory o) |
private java.util.Set<Extension> |
SccCompleteReasoner.computeExtensionsViaSccs(DungTheory theory,
java.util.List<java.util.Collection<Argument>> sccs,
int idx,
java.util.Collection<Argument> in,
java.util.Collection<Argument> out,
java.util.Collection<Argument> undec)
Computes extensions recursively following the SCC structure.
|
private java.util.Collection<Argument> |
CF2Reasoner.getOutparents(DungTheory af,
java.util.Collection<Argument> s)
Returns the set { a in A | a nicht in S und a -> S }
|
private java.util.Set<Extension> |
CF2Reasoner.singleAFExtensions(DungTheory theory)
Computes the extensions for the single af case.
|
Constructor and Description |
---|
GrossiModgilRankingReasoner(DungTheory theory)
Creates a new reasoner for the given Dung theory
|
Modifier and Type | Field and Description |
---|---|
private static java.util.Map<DungTheory,java.util.Collection<Division>> |
Division.archivedDivisons
archive of requested divisions.
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<DungTheory> |
Division.getDividers(DungTheory theory,
Semantics semantics)
Returns the dividers for this division, i.e.
|
Modifier and Type | Method and 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.
|
Modifier and Type | Field and Description |
---|---|
private DungTheory |
LdoInterpretation.theory
The abstract argumentation framework
|
Constructor and Description |
---|
LdoInterpretation(DungTheory theory,
Extension ext,
Semantics semantics)
Creates a new interpretation
|
LdoInterpretation(DungTheory theory,
Semantics semantics)
Creates a new interpretation
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<DungTheory> |
LdoFormula.getDividers(DungTheory theory,
Semantics semantics)
Returns the dividers for this formula, i.e.
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<DungTheory> |
LdoFormula.getDividers(DungTheory theory,
Semantics semantics)
Returns the dividers for this formula, i.e.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
TgfParser.parse(java.io.Reader reader) |
DungTheory |
CnfParser.parse(java.io.Reader reader) |
abstract DungTheory |
AbstractDungParser.parse(java.io.Reader reader)
Parses the given file into an abstract argumentation framework
|
DungTheory |
ApxParser.parse(java.io.Reader reader) |
DungTheory |
AbstractDungParser.parseBeliefBase(java.io.Reader reader) |
DungTheory |
DungParser.parseBeliefBase(java.io.Reader reader) |
static DungTheory |
DungParser.Theory() |
Modifier and Type | Method and Description |
---|---|
static void |
DungParser.Argument(DungTheory dungTheory) |
static void |
DungParser.Attack(DungTheory dungTheory) |
static void |
DungParser.Expression(DungTheory dungTheory) |
Modifier and Type | Method and Description |
---|---|
java.util.Set<Extension> |
ProboSolver.enumerate(Problem problem,
DungTheory aaf,
FileFormat format)
Solves the given enumeration problem on the given AAF with
|
boolean |
ProboSolver.justify(Problem problem,
DungTheory aaf,
FileFormat format,
Argument arg)
Solves the given justification problem on the given AAF
|
java.lang.String |
ProboSolver.solve(Problem problem,
DungTheory aaf,
FileFormat format,
java.lang.String additionalParameters)
Solves the given problem on the given AAF with possibly
additional parameters.
|
boolean |
TweetySolver.solveDC(Semantics semantics,
DungTheory aaf,
Argument arg) |
abstract boolean |
AbstractDungSolver.solveDC(Semantics semantics,
DungTheory aaf,
Argument arg)
Solves the problem of deciding whether an argument (given as additional parameter) is credulously inferred
and returns either "true" (if it is credulously inferred) or "false" (if it is not credulously inferred)
|
boolean |
TweetySolver.solveDE(Semantics semantics,
DungTheory aaf,
java.util.Collection<Argument> args) |
abstract boolean |
AbstractDungSolver.solveDE(Semantics semantics,
DungTheory aaf,
java.util.Collection<Argument> args)
Solves the problem of deciding whether there is labeling with the set of arguments
(given as additional parameter) being the exact set of argument that is labeled in and returns either "true" (there is
such a labeling) or "false" (there is no such labeling).
|
boolean |
TweetySolver.solveDL(Semantics semantics,
DungTheory aaf,
Labeling lab) |
abstract boolean |
AbstractDungSolver.solveDL(Semantics semantics,
DungTheory aaf,
Labeling lab)
Solves the problem of deciding whether the given labeling is a valid labeling wrt.
|
boolean |
TweetySolver.solveDN(Semantics semantics,
DungTheory aaf) |
abstract boolean |
AbstractDungSolver.solveDN(Semantics semantics,
DungTheory aaf)
Solves the problem of deciding whether there exists a labeling
which labels at least one argument in and returns out either "true"
(there is such a labeling) or "false" (there is no such labeling).
|
boolean |
TweetySolver.solveDS(Semantics semantics,
DungTheory aaf,
Argument arg) |
abstract boolean |
AbstractDungSolver.solveDS(Semantics semantics,
DungTheory aaf,
Argument arg)
Solves the problem of deciding whether an argument (given as additional parameter) is skeptically inferred
and returns either "true" (if it is skeptically inferred) or "false" (if it is not skeptically inferred)
|
boolean |
TweetySolver.solveDX(Semantics semantics,
DungTheory aaf) |
abstract boolean |
AbstractDungSolver.solveDX(Semantics semantics,
DungTheory aaf)
Solves the problem of deciding whether there exists a labeling
and returns out either "true" (there is a labeling) or "false" (there is no labeling).
|
java.util.Collection<Argument> |
TweetySolver.solveEC(Semantics semantics,
DungTheory aaf) |
abstract java.util.Collection<Argument> |
AbstractDungSolver.solveEC(Semantics semantics,
DungTheory aaf)
Enumerates all arguments that are credulously inferred.
|
java.util.Collection<java.util.Collection<Argument>> |
TweetySolver.solveEE(Semantics semantics,
DungTheory aaf) |
abstract java.util.Collection<java.util.Collection<Argument>> |
AbstractDungSolver.solveEE(Semantics semantics,
DungTheory aaf)
Enumerates all sets for which there is a labeling that labels
exactly these arguments as in.
|
java.util.Collection<Labeling> |
TweetySolver.solveEL(Semantics semantics,
DungTheory aaf) |
abstract java.util.Collection<Labeling> |
AbstractDungSolver.solveEL(Semantics semantics,
DungTheory aaf)
Enumerates all labelings for the given semantics of the given framework.
|
java.util.Collection<Argument> |
TweetySolver.solveES(Semantics semantics,
DungTheory aaf) |
abstract java.util.Collection<Argument> |
AbstractDungSolver.solveES(Semantics semantics,
DungTheory aaf)
Enumerates all arguments that skeptically inferred.
|
java.util.Collection<Argument> |
TweetySolver.solveSE(Semantics semantics,
DungTheory aaf) |
abstract java.util.Collection<Argument> |
AbstractDungSolver.solveSE(Semantics semantics,
DungTheory aaf)
Returns one extension wrt.
|
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractArgumentationInterpretation.isAcceptable(Argument argument,
DungTheory dungTheory)
returns true if every attacker on
|
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.
|
Constructor and Description |
---|
Labeling(DungTheory theory,
Extension ext)
Creates a new labeling from the given extension wrt.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Collection<DungTheory> |
IsoSafeEnumeratingDungTheoryGenerator.currentTheories
The set of all Dung theories with cntArguments arguments and cntAttacks attacks.
|
private java.util.Iterator<DungTheory> |
IsoSafeEnumeratingDungTheoryGenerator.iterator
The iterator on currentTheories.
|
private Parser<DungTheory> |
FileDungTheoryGenerator.parser
A parser for parsing the files.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
PodlaszewskiCaminadaDungTheoryGenerator.generate() |
DungTheory |
IsoSafeEnumeratingDungTheoryGenerator.generate() |
DungTheory |
FileDungTheoryGenerator.generate() |
DungTheory |
EnumeratingDungTheoryGenerator.generate() |
DungTheory |
DungTheoryGenerator.generate()
Generates a new Dung theory
|
DungTheory |
DefaultDungTheoryGenerator.generate() |
DungTheory |
PodlaszewskiCaminadaDungTheoryGenerator.generate(Argument arg) |
DungTheory |
IsoSafeEnumeratingDungTheoryGenerator.generate(Argument arg) |
DungTheory |
FileDungTheoryGenerator.generate(Argument arg) |
DungTheory |
EnumeratingDungTheoryGenerator.generate(Argument arg) |
DungTheory |
DungTheoryGenerator.generate(Argument arg)
Generates a new Dung theory where the given argument
is enforced to be in the grounded extension
|
DungTheory |
DefaultDungTheoryGenerator.generate(Argument arg) |
private DungTheory |
DefaultDungTheoryGenerator.generateTreeShape(Argument arg)
Generates a Dung theory with a tree shape where the given argument
is the root.
|
Modifier and Type | Method and Description |
---|---|
private boolean |
IsoSafeEnumeratingDungTheoryGenerator.isIsomorphic(DungTheory theory,
java.util.Collection<DungTheory> theories)
Checks whether the first theory is isomorphic to some theory
in "theories".
|
Modifier and Type | Method and Description |
---|---|
private boolean |
IsoSafeEnumeratingDungTheoryGenerator.isIsomorphic(DungTheory theory,
java.util.Collection<DungTheory> theories)
Checks whether the first theory is isomorphic to some theory
in "theories".
|
Constructor and Description |
---|
FileDungTheoryGenerator(java.io.File[] files,
Parser<DungTheory> parser)
Creates a new theory generator for the given files, which
can be parsed by the given parser.
|
Modifier and Type | Method and Description |
---|---|
void |
TgfWriter.write(DungTheory aaf,
java.io.File f) |
abstract void |
DungWriter.write(DungTheory aaf,
java.io.File f)
Writes the given file into an abstract argumentation framework
|
void |
CnfWriter.write(DungTheory aaf,
java.io.File f) |
void |
ApxWriter.write(DungTheory aaf,
java.io.File f) |
Modifier and Type | Class and Description |
---|---|
class |
ProbabilisticArgumentationFramework
This class implements the probabilistic argumentation framework approach
of [Li, Oren, Norman.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
ProbabilisticArgumentationFramework.sample()
Samples a random DungTheory from this framework wrt.
|
Modifier and Type | Method and Description |
---|---|
Probability |
ProbabilisticArgumentationFramework.getProbability(DungTheory aaf)
Computes the probability of the given AAF wrt.
|
Modifier and Type | Field and Description |
---|---|
private DungTheory |
PAInconsistencyMeasure.dungTheory
The Dung theory against the partial prob assignments are measured.
|
Constructor and Description |
---|
PAInconsistencyMeasure(RealVectorNorm norm,
DungTheory theory,
PASemantics semantics)
Creates a new inconsinstency measure which uses the given norm and
measures wrt.
|
Modifier and Type | Method and Description |
---|---|
ProbabilisticExtension |
PAUpdateOperator.change(PartialProbabilityAssignment ppa,
DungTheory theory) |
ProbabilisticExtension |
PARevisionOperator.change(PartialProbabilityAssignment ppa,
DungTheory theory) |
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.
|
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 |
AbstractPAChangeOperator.change(ProbabilisticExtension p,
DungTheory theory) |
protected void |
AbstractPAChangeOperator.prepareOptimizationProblem(PartialProbabilityAssignment ppa,
DungTheory theory,
OptimizationProblem problem,
java.util.Map<java.util.Collection<Argument>,FloatVariable> varsComp,
java.util.Map<java.util.Collection<Argument>,FloatVariable> varsSem,
java.util.Vector<Term> varsCompVector,
java.util.Vector<Term> varsSemVector) |
Modifier and Type | Field and Description |
---|---|
private DungTheory |
LdoArgumentationLottery.aaf
The AAF used.
|
private DungTheory |
ArgumentationLottery.aaf
The AAF used.
|
private DungTheory |
SubgraphProbabilityFunction.theory
The theory of this probability function.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
SubgraphProbabilityFunction.getTheory()
Returns the theory of this probability function.
|
DungTheory |
LdoArgumentationLottery.getTheory()
Returns the used argumentation theory.
|
DungTheory |
ArgumentationLottery.getTheory()
Returns the used argumentation theory.
|
Modifier and Type | Method and Description |
---|---|
java.lang.Double |
UtilityFunction.getUtility(DungTheory theory,
Semantics semantics)
Gets the utility of the given theory wrt.
|
java.lang.Double |
LdoUtilityFunction.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.
|
private java.util.Set<Attack> |
SubgraphProbabilityFunction.superGraphs(DungTheory g,
DungTheory gp,
DungTheory c)
Computes Super(G,G′,Ci) = {(α,β) ∈ Arcs(G) | (α ∈ Nodes(G′) and β ∈ Nodes(Ci))
or (α ∈ Nodes(Ci) and β ∈ Nodes(G′))
or (α ∈ Nodes(Ci) and β ∈ Nodes(Ci))
|
Constructor and Description |
---|
SubgraphProbabilityFunction(DungTheory theory)
Creates a new uniform probability function for the given theory, i.e.
|
Modifier and Type | Method and 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.
|
java.util.Collection<Statement> |
SemiOptimisticPASemantics.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> |
RationalPASemantics.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> |
OptimisticPASemantics.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> |
JustifiablePASemantics.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> |
FoundedPASemantics.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) |
abstract java.util.Collection<Statement> |
AbstractPASemantics.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.
|
boolean |
SemiOptimisticPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
SemiFoundedPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
RationalPASemantics.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 |
OptimisticPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
NeutralPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
JustifiablePASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
InvolutaryPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
FoundedPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
boolean |
CoherentPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
abstract boolean |
AbstractPASemantics.satisfies(ProbabilisticExtension p,
DungTheory theory) |
Modifier and Type | Class and Description |
---|---|
class |
StructuredArgumentationFramework
This class represents a structured argumentation framework, i.e.
|
Modifier and Type | Method and Description |
---|---|
DungTheory |
StructuredArgumentationFramework.toDungTheory()
Constructs a (pure) Dung theory from this structured argumentation framework.
|
Modifier and Type | Class and Description |
---|---|
class |
SocialAbstractArgumentationFramework
This class implements a social abstract argumentation framework from
[Joao Leite, Joao Martins.
|
Modifier and Type | Method and Description |
---|---|
boolean |
SocialAbstractArgumentationFramework.add(DungTheory theory) |