public class ProbabilisticArgumentationFramework extends DungTheory
| Modifier and Type | Field and Description |
|---|---|
private java.util.Map<Argument,Probability> |
argumentProbabilityAssignment
Probability assignments to arguments (with independence assumption).
|
private java.util.Map<Attack,Probability> |
attackProbabilityAssignment
Probability assignments to attacks (with independence assumption).
|
IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS| Constructor and Description |
|---|
ProbabilisticArgumentationFramework()
Default constructor; initializes empty sets of arguments and attacks
|
ProbabilisticArgumentationFramework(Graph<Argument> graph)
Creates a new PAF from the given graph, all arguments
and attacks have probability 1.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
add(Argument a)
Adds the given node to this graph.
|
boolean |
add(Argument a,
Probability p)
Adds the given argument with the given probability
|
boolean |
add(Attack att)
Adds the given attack to this dung theory.
|
boolean |
add(Attack att,
Probability p)
Adds the given attack with the given probability
|
Probability |
getProbability(Argument a)
Returns the probability of the given argument.
|
Probability |
getProbability(Attack a)
Returns the probability of the given attack.
|
Probability |
getProbability(DungTheory aaf)
Computes the probability of the given AAF wrt.
|
SubgraphProbabilityFunction |
getSubgraphProbabilityFunction()
Returns the complete subgraph probability function on the subgraphs
of this PAF, assuming independence between probabilities of all
arguments and attacks.
|
boolean |
isWeightedGraph()
Checks whether this graph only contains weighted edges.
|
boolean |
remove(Argument a)
Removes the argument and all its attacks
|
boolean |
remove(Attack attack)
Removes the given attack from this Dung theory.
|
DungTheory |
sample()
Samples a random DungTheory from this framework wrt.
|
java.lang.String |
toString() |
add, add, addAllAttacks, areAdjacent, compareTo, contains, containsAll, equals, existsDirectedPath, faf, getAdjancyMatrix, getAttacked, getAttackers, getAttacks, getChildren, getComplementGraph, getEdge, getEdges, getNeighbors, getNodes, getNumberOfNodes, getParents, getRestriction, getSignature, getStronglyConnectedComponents, getSubgraphs, hashCode, hasSelfLoops, isAttacked, isAttacked, isAttackedBy, isAttackedBy, isAttackingAllOtherArguments, isCoherent, isIndirectAttack, isRelativelyCoherent, isSupport, isWellFounded, prettyPrint, removeAlladdAll, clear, instantiateSet, isEmpty, iterator, remove, retainAll, size, toArray, toArrayprivate java.util.Map<Argument,Probability> argumentProbabilityAssignment
private java.util.Map<Attack,Probability> attackProbabilityAssignment
public ProbabilisticArgumentationFramework()
public boolean add(Attack att)
DungTheoryadd in class DungTheoryatt - an attackpublic boolean add(Attack att, Probability p)
att - some attackp - some probabilitypublic boolean add(Argument a)
Graphpublic boolean add(Argument a, Probability p)
a - some argumentp - some probabilitypublic boolean remove(Attack attack)
DungTheoryremove in class DungTheoryattack - an attackpublic boolean remove(Argument a)
DungTheoryremove in class DungTheorya - some argumentpublic Probability getProbability(Argument a)
a - some argumentpublic Probability getProbability(Attack a)
a - some attackpublic Probability getProbability(DungTheory aaf)
aaf - some AAF (supposedly a subgraph of this framework)public SubgraphProbabilityFunction getSubgraphProbabilityFunction()
public DungTheory sample()
public boolean isWeightedGraph()
GraphisWeightedGraph in interface Graph<Argument>isWeightedGraph in class DungTheorypublic java.lang.String toString()
toString in interface BeliefBasetoString in interface Graph<Argument>toString in class DungTheory