public class SocialAbstractArgumentationFramework extends DungTheory
Modifier and Type | Field and Description |
---|---|
private java.util.Map<Argument,java.lang.Integer> |
neg_votes
The number of negative votes of arguments
|
private java.util.Map<Argument,java.lang.Integer> |
pos_votes
The number of positive votes of arguments
|
IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS
Constructor and Description |
---|
SocialAbstractArgumentationFramework()
Creates a new empty social abstract argumentation framework
|
SocialAbstractArgumentationFramework(Graph<Argument> graph)
Creates a new social abstract argumentation framework from the given graph.
|
Modifier and Type | Method and Description |
---|---|
boolean |
add(Argument a)
Adds the given node to this graph.
|
boolean |
add(DungTheory theory)
Adds all arguments and attacks of the given theory to
this theory
|
int |
getNegative(Argument arg)
Returns the number of negative votes of the given argument
|
int |
getPositive(Argument arg)
Returns the number of positive votes of the given argument
|
boolean |
remove(Argument a)
Removes the argument and all its attacks
|
java.lang.String |
toString() |
void |
voteDown(Argument arg)
Adds a negative vote to the given argument.
|
void |
voteDown(Argument arg,
int number)
Adds the given number of negative votes to the
given argument
|
void |
voteUp(Argument arg)
Adds a positive vote to the given argument.
|
void |
voteUp(Argument arg,
int number)
Adds the given number of positive votes to the
given argument
|
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, isWeightedGraph, isWellFounded, prettyPrint, remove, removeAll
addAll, clear, instantiateSet, isEmpty, iterator, remove, retainAll, size, toArray, toArray
private java.util.Map<Argument,java.lang.Integer> pos_votes
private java.util.Map<Argument,java.lang.Integer> neg_votes
public SocialAbstractArgumentationFramework()
public int getPositive(Argument arg)
arg
- some argumentpublic int getNegative(Argument arg)
arg
- some argumentpublic void voteUp(Argument arg, int number)
arg
- some argumentnumber
- some numberpublic void voteUp(Argument arg)
arg
- some argumentpublic void voteDown(Argument arg, int number)
arg
- some argumentnumber
- some numberpublic void voteDown(Argument arg)
arg
- some argumentpublic boolean remove(Argument a)
DungTheory
remove
in class DungTheory
a
- some argumentpublic boolean add(Argument a)
Graph
public boolean add(DungTheory theory)
DungTheory
add
in class DungTheory
theory
- some Dung theorypublic java.lang.String toString()
toString
in interface BeliefBase
toString
in interface Graph<Argument>
toString
in class DungTheory