Package org.tweetyproject.arg.setaf.syntax

Class SetAf

java.lang.Object

org.tweetyproject.commons.BeliefSet<Argument,SetAfSignature>

org.tweetyproject.arg.setaf.syntax.SetAf

All Implemented Interfaces:

Comparable<SetAf>, Iterable<Argument>, Collection<Argument>, ArgumentationFramework<Argument>, BeliefBase, DirHyperGraph<Argument>, GeneralGraph<Argument>

public class SetAf
extends BeliefSet<Argument,SetAfSignature>
implements DirHyperGraph<Argument>, Comparable<SetAf>, ArgumentationFramework<Argument>

This class implements a SetAF in the sense of Nielson/Parson:

Author:

Sebastian Franke, Lars Bengel

See Also:

• "Nielsen, Soren Holbech and Parsons, Simon. A Generalization of Dung's Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments. Argumentation in Multi-Agent Systems: Third International Workshop, ArgMAS 2006."

Field Summary

Fields inherited from class org.tweetyproject.commons.BeliefSet

EQUALS_USES_SIGNATURE

Fields inherited from interface org.tweetyproject.graphs.DirHyperGraph

IGNORE_SELFLOOPS, INVERT_SELFLOOPS, REMOVE_SELFLOOPS

Constructor Summary

Constructors

Constructor	Description
SetAf()	Initializes a new enpty SetAf
SetAf(SetAf graph)	Creates a new theory from the given DirHyperGraph.

Method Summary

Modifier and Type	Method	Description
boolean	add(Argument arg)	Add argument to SetAf
boolean	add(SetAf theory)	Adds all arguments and attacks of the given theory to this theory
boolean	add(SetAttack edge)	Return whether the attack was added or not
boolean	add(GeneralEdge edge)	Adds the given edge to this DirHyperGraph.
boolean	addAllAttacks(Set<SetAttack> edges2)	Adds the set of attacks to this SetAf theory.
boolean	addAttack(HashSet<Argument> hashSet, Argument attacked)	Adds an attack from the first argument to the second to this SetAf theory.
boolean	addAttack(Argument attacker, Argument attacked)	Adds an attack from the first argument to the second to this SetAf theory.
boolean	areAdjacent(Argument a, Argument b)	Returns "true" iff the two nodes are connected by a directed edge from a to b or an undirected edge.
SetAf	clone()	clones the SetAf
int	compareTo(SetAf o)
boolean	contains(Object obj)	Returns "true" when this DirHyperGraph contains the given node or edge.
boolean	containsAll(Collection<?> c)	Checks if the argumentation framework contains all the elements in the given collection.
boolean	containsAttack(SetAttack att)	Checks whether this theory contains the given attack.
boolean	equals(Object obj)
boolean	existsDirectedPath(Argument node1, Argument node2)	Checks whether there is a (directed) path from node1 to node2.
static <S extends Node> boolean	existsDirectedPath(SetAf hyperGraph, Argument node1, Argument node2)	Return whether the path exists
Extension<SetAf>	faf(Extension<SetAf> extension)	The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt.
Matrix	getAdjacencyMatrix()	Returns the adjacency matrix of this DirHyperGraph (the order of the nodes is the same as returned by "iterator()").
Collection<Argument>	getAttacked(Collection<Argument> arguments)	Computes the set of arguments collectively attacked by arguments.
Collection<Collection<Argument>>	getAttackers(Argument node)	Computes the set {A | (A,argument) in attacks}.
Set<SetAttack>	getAttacks()	Return all attacks
Collection<Argument>	getChildren(Set<Argument> node)	Return the children of the node
Collection<Argument>	getChildren(Node node)	Returns the set of children (node connected via an undirected edge or a directed edge where the given node is the parent) of the given node.
SetAf	getComplementGraph(int selfloops)	Returns the complement DirHyperGraph of this DirHyperGraph, i.e.
SetAttack	getDirEdge(Set<Argument> node1, Node b)	Return the edge between the two
SetAttack	getEdge(Argument a, Argument b)	Returns the corresponding edge (a,b) if a and b are adjacent.
Collection	getEdges()	Returns the edges of this DirHyperGraph.
Signature	getMinimalSignature()	Returns the signature of the language of this knowledge base.
Collection<Argument>	getNeighbors(Argument node)	Returns the set of neighbors of the given node.
Collection<Argument>	getNodes()	Returns the nodes of this DirHyperGraph.
int	getNumberOfNodes()	Returns the number of nodes in this DirHyperGraph.
Collection<Set<Argument>>	getParents(Argument node)	Return the arguments' parents
Collection<Argument>	getParents(Node node)	Returns the set of parents (node connected via an undirected edge or a directed edge where the given node is the child) of the given node.
SetAf	getRestriction(Collection<Argument> nodes)	Returns copy of this DirHyperGraph consisting only of the given nodes and all corresponding edges.
Collection	getStronglyConnectedComponents()	Returns the strongly connected components of this DirHyperGraph.
Collection<SetAf>	getSubgraphs(SetAf g)	Returns the set of sub graphs of the given graph.
Collection<DirHyperGraph<Argument>>	getSubGraphs()	Returns the set of sub DirHyperGraphs of this DirHyperGraph.
static Collection<DirHyperGraph<Argument>>	getSubgraphsHelper(SetAf g)	Return the subgraphs of the SetAf
int	hashCode()
boolean	hasSelfLoops()	Returns "true" iff the DirHyperGraph has a self loop (an edge from a node to itself).
boolean	isAcceptable(Argument argument, Extension<SetAf> ext)	returns true if every attacker on argument is attacked by some accepted argument wrt.
boolean	isAdmissible(Extension<SetAf> ext)	returns true if every accepted argument of this is defended by some accepted argument wrt.
boolean	isAttacked(Argument argument, Extension<? extends ArgumentationFramework<?>> ext)	returns true if some argument of ext attacks argument.
boolean	isAttackedBy(Argument arg2, Collection<Argument> ext)	returns true if some argument of ext is attacked by argument.
boolean	isAttackedBy(Argument arg1, Argument arg2)	Checks whether arg1 is attacked by arg2.
boolean	isAttackingAllOtherArguments(Extension<SetAf> ext)	returns true if arguments attack all other arguments in the theory
boolean	isConflictFree(Extension<SetAf> arguments)	returns true if one arguments in arguments attacks another within this attack relation.
boolean	isStable(Extension<SetAf> ext)	Checks whether the given extension is stable wrt.
boolean	isWeightedGraph()	Checks whether this DirHyperGraph only contains weighted edges.
Iterator<Argument>	iterator()
Set<Set<Argument>>	powerSet(Set<Argument> originalSet)	Return the powerset of
String	prettyPrint()	Pretty prints the SetAf
boolean	remove(Argument a)	Removes the argument and all its attacks
boolean	remove(SetAttack attack)	Removes the given attack from this SetAf theory.
boolean	removeAll(Collection<?> c)
int	size()
String	toString()

Methods inherited from class org.tweetyproject.commons.BeliefSet

add, addAll, clear, getSignature, isEmpty, remove, retainAll, setSignature, toArray, toArray, toString

Methods inherited from class java.lang.Object

getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.util.Collection

parallelStream, removeIf, spliterator, stream, toArray

Methods inherited from interface java.lang.Iterable

forEach

Constructor Details

SetAf

public SetAf()

Initializes a new enpty SetAf

SetAf

public SetAf(SetAf graph)

Creates a new theory from the given DirHyperGraph.

Parameters:

graph - some DirHyperGraph

Method Details

size

public int size()

Specified by:

size in interface Collection<Argument>

Overrides:

size in class BeliefSet<Argument,SetAfSignature>

iterator

public Iterator<Argument> iterator()

Specified by:

iterator in interface Collection<Argument>

Specified by:

iterator in interface DirHyperGraph<Argument>

Specified by:

iterator in interface Iterable<Argument>

Overrides:

iterator in class BeliefSet<Argument,SetAfSignature>

clone

public SetAf clone()

clones the SetAf

Returns:

a SetAf

getMinimalSignature

public Signature getMinimalSignature()

Description copied from interface: BeliefBase

Returns the signature of the language of this knowledge base.

Specified by:

getMinimalSignature in interface BeliefBase

Returns:

the signature of the language of this knowledge base.

isAttackingAllOtherArguments

public boolean isAttackingAllOtherArguments(Extension<SetAf> ext)

returns true if arguments attack all other arguments in the theory

Parameters:

ext - An extension contains a set of arguments.

Returns:

true if arguments attack all other arguments in the theory

isConflictFree

public boolean isConflictFree(Extension<SetAf> arguments)

returns true if one arguments in arguments attacks another within this attack relation.

Parameters:

arguments - a list of arguments

Returns:

returns true if one arguments in arguments attacks another.

isAcceptable

public boolean isAcceptable(Argument argument,
 Extension<SetAf> ext)

returns true if every attacker on argument is attacked by some accepted argument wrt. the given theory.

Parameters:

argument - an argument

ext - an extension (the knowledge base)

Returns:

true if every attacker on argument is attacked by some accepted argument wrt. the given theory.

isAdmissible

public boolean isAdmissible(Extension<SetAf> ext)

returns true if every accepted argument of this is defended by some accepted argument wrt. the given SetAf theory.

Parameters:

ext - an extension.

Returns:

true if every accepted argument of this is defended by some accepted argument wrt. the given SetAf theory.

getAttackers

public Collection<Collection<Argument>> getAttackers(Argument node)

Computes the set {A | (A,argument) in attacks}.

Parameters:

node - an argument

Returns:

the set of all sets of arguments that attack argument.

getAttacked

public Collection<Argument> getAttacked(Collection<Argument> arguments)

Computes the set of arguments collectively attacked by arguments.

Parameters:

arguments - a set of arguments

Returns:

set of arguments collectively attacked by arguments

isAttacked

public boolean isAttacked(Argument argument,
 Extension<? extends ArgumentationFramework<?>> ext)

returns true if some argument of ext attacks argument.

Specified by:

isAttacked in interface ArgumentationFramework<Argument>

Parameters:

argument - an argument

ext - an extension, i.e. a set of arguments

Returns:

true if some argument of ext attacks argument.

isAttackedBy

public boolean isAttackedBy(Argument arg2,
 Collection<Argument> ext)

returns true if some argument of ext is attacked by argument.

Parameters:

arg2 - an argument

ext - an extension, i.e. a set of arguments

Returns:

true if some argument of ext is attacked by argument.

isAttackedBy

public boolean isAttackedBy(Argument arg1,
 Argument arg2)

Checks whether arg1 is attacked by arg2.

Parameters:

arg1 - an argument.

arg2 - an argument.

Returns:

"true" if arg1 is attacked by arg2

isStable

public boolean isStable(Extension<SetAf> ext)

Checks whether the given extension is stable wrt. this theory.

Parameters:

ext - some extension

Returns:

"true" iff the extension is stable.

faf

public Extension<SetAf> faf(Extension<SetAf> extension)

The characteristic function of an abstract argumentation framework: F_AF(S) = {A|A is acceptable wrt. S}.

Parameters:

extension - an extension (a set of arguments).

Returns:

an extension (a set of arguments).

add

public boolean add(Argument arg)

Add argument to SetAf

Specified by:

add in interface Collection<Argument>

Specified by:

add in interface DirHyperGraph<Argument>

Overrides:

add in class BeliefSet<Argument,SetAfSignature>

Parameters:

arg - some argument

Returns:

true if argument has been added

addAttack

public boolean addAttack(HashSet<Argument> hashSet,
 Argument attacked)

Adds an attack from the first argument to the second to this SetAf theory.

Parameters:

hashSet - some arguments

attacked - some argument

Returns:

"true" if the set of attacks has been modified.

addAttack

public boolean addAttack(Argument attacker,
 Argument attacked)

Adds an attack from the first argument to the second to this SetAf theory.

Parameters:

attacker - some argument

attacked - some argument

Returns:

"true" if the set of attacks has been modified.

remove

public boolean remove(SetAttack attack)

Removes the given attack from this SetAf theory.

Parameters:

attack - an attack

Returns:

"true" if the set of attacks has been modified.

remove

public boolean remove(Argument a)

Removes the argument and all its attacks

Parameters:

a - some argument

Returns:

true if this structure has been changed

removeAll

public boolean removeAll(Collection<?> c)

Specified by:

removeAll in interface Collection<Argument>

Overrides:

removeAll in class BeliefSet<Argument,SetAfSignature>

containsAll

public boolean containsAll(Collection<?> c)

Description copied from interface: ArgumentationFramework

Checks if the argumentation framework contains all the elements in the given collection.

Specified by:

containsAll in interface ArgumentationFramework<Argument>

Specified by:

containsAll in interface Collection<Argument>

Overrides:

containsAll in class BeliefSet<Argument,SetAfSignature>

Parameters:

c - the collection of elements to be checked for containment.

Returns:

true if this framework contains all elements in the specified collection, false otherwise.

containsAttack

public boolean containsAttack(SetAttack att)

Checks whether this theory contains the given attack.

Parameters:

att - some attack

Returns:

"true" iff this theory contains the given attack.

addAllAttacks

public boolean addAllAttacks(Set<SetAttack> edges2)

Adds the set of attacks to this SetAf theory.

Parameters:

edges2 - a collection of attacks

Returns:

"true" if this SetAf theory has been modified.

add

public boolean add(SetAf theory)

Adds all arguments and attacks of the given theory to this theory

Parameters:

theory - some SetAf theory

Returns:

"true" if this SetAf Theory has been modified

hashCode

public int hashCode()

Specified by:

hashCode in interface Collection<Argument>

Overrides:

hashCode in class BeliefSet<Argument,SetAfSignature>

equals

public boolean equals(Object obj)

Specified by:

equals in interface Collection<Argument>

Overrides:

equals in class BeliefSet<Argument,SetAfSignature>

compareTo

public int compareTo(SetAf o)

Specified by:

compareTo in interface Comparable<SetAf>

add

public boolean add(SetAttack edge)

Return whether the attack was added or not

Parameters:

edge - attack

Returns:

whether the attack was added or not

getNodes

public Collection<Argument> getNodes()

Description copied from interface: DirHyperGraph

Returns the nodes of this DirHyperGraph.

Specified by:

getNodes in interface ArgumentationFramework<Argument>

Specified by:

getNodes in interface DirHyperGraph<Argument>

Specified by:

getNodes in interface GeneralGraph<Argument>

Returns:

the nodes of this DirHyperGraph.

getNumberOfNodes

public int getNumberOfNodes()

Description copied from interface: DirHyperGraph

Returns the number of nodes in this DirHyperGraph.

Specified by:

getNumberOfNodes in interface DirHyperGraph<Argument>

Returns:

the number of nodes in this DirHyperGraph.

areAdjacent

public boolean areAdjacent(Argument a,
 Argument b)

Description copied from interface: DirHyperGraph

Returns "true" iff the two nodes are connected by a directed edge from a to b or an undirected edge.

Specified by:

areAdjacent in interface DirHyperGraph<Argument>

Parameters:

a - some node

b - some node

Returns:

"true" iff the two nodes are connected by a directed edge from a to b or an undirected edge.

getEdge

public SetAttack getEdge(Argument a,
 Argument b)

Description copied from interface: DirHyperGraph

Returns the corresponding edge (a,b) if a and b are adjacent. Otherwise it returns null.

Specified by:

getEdge in interface DirHyperGraph<Argument>

Parameters:

a - some node

b - some node

Returns:

the edge (a,b) or null.

getAttacks

public Set<SetAttack> getAttacks()

Return all attacks

Returns:

all attacks

getDirEdge

public SetAttack getDirEdge(Set<Argument> node1,
 Node b)

Return the edge between the two

Parameters:

node1 - an attacking set

b - an argument

Returns:

the edge between the two

getEdges

public Collection getEdges()

Description copied from interface: DirHyperGraph

Returns the edges of this DirHyperGraph.

Specified by:

getEdges in interface DirHyperGraph<Argument>

Specified by:

getEdges in interface GeneralGraph<Argument>

Returns:

the edges of this DirHyperGraph.

contains

public boolean contains(Object obj)

Description copied from interface: DirHyperGraph

Returns "true" when this DirHyperGraph contains the given node or edge.

Specified by:

contains in interface Collection<Argument>

Specified by:

contains in interface DirHyperGraph<Argument>

Overrides:

contains in class BeliefSet<Argument,SetAfSignature>

Parameters:

obj - an object

Returns:

"true" if this DirHyperGraph contains the given node or edge.

getChildren

public Collection<Argument> getChildren(Set<Argument> node)

Return the children of the node

Parameters:

node - the node

Returns:

the children of the node

getParents

public Collection<Argument> getParents(Node node)

Description copied from interface: DirHyperGraph

Returns the set of parents (node connected via an undirected edge or a directed edge where the given node is the child) of the given node.

Specified by:

getParents in interface DirHyperGraph<Argument>

Parameters:

node - some node (must be in the DirHyperGraph).

Returns:

the set of parents of the given node.

getParents

public Collection<Set<Argument>> getParents(Argument node)

Return the arguments' parents

Parameters:

node - an argument

Returns:

the arguments' parents

existsDirectedPath

public static <S extends Node> boolean existsDirectedPath(SetAf hyperGraph,
 Argument node1,
 Argument node2)

Return whether the path exists

Type Parameters:

S - a node

Parameters:

hyperGraph - a setAf

node1 - an argument

node2 - an argument

Returns:

whether the path exists

existsDirectedPath

public boolean existsDirectedPath(Argument node1,
 Argument node2)

Description copied from interface: DirHyperGraph

Checks whether there is a (directed) path from node1 to node2.

Specified by:

existsDirectedPath in interface DirHyperGraph<Argument>

Parameters:

node1 - some node.

node2 - some node.

Returns:

"true" if there is a directed path from node1 to node2.

getNeighbors

public Collection<Argument> getNeighbors(Argument node)

Description copied from interface: DirHyperGraph

Returns the set of neighbors of the given node.

Specified by:

getNeighbors in interface DirHyperGraph<Argument>

Parameters:

node - some node (must be in the DirHyperGraph).

Returns:

the set of neighbors of the given node.

getAdjacencyMatrix

public Matrix getAdjacencyMatrix()

Description copied from interface: DirHyperGraph

Returns the adjacency matrix of this DirHyperGraph (the order of the nodes is the same as returned by "iterator()").

Specified by:

getAdjacencyMatrix in interface DirHyperGraph<Argument>

Returns:

the adjacency matrix of this DirHyperGraph

powerSet

public Set<Set<Argument>> powerSet(Set<Argument> originalSet)

Return the powerset of

Parameters:

originalSet - original set

Returns:

the powerset of

getComplementGraph

public SetAf getComplementGraph(int selfloops)

Description copied from interface: DirHyperGraph

Returns the complement DirHyperGraph of this DirHyperGraph, i.e. the DirHyperGraph on the same set of vertices as this DirHyperGraph that connects two vertices v and w with an edge if and only if v and w are not connected in this DirHyperGraph.

Specified by:

getComplementGraph in interface DirHyperGraph<Argument>

Parameters:

selfloops - Indicates how to deal with selfloops:
IGNORE_SELFLOOPS - ignore self loops (don't add and don't remove)
INVERT_SELFLOOPS - deal with self loops like ordinary edges (add if not present and remove if present)
REMOVE_SELFLOOPS - simple remove self loops, but don't add new ones.

Returns:

the complement DirHyperGraph of this DirHyperGraph.

getStronglyConnectedComponents

public Collection getStronglyConnectedComponents()

Description copied from interface: DirHyperGraph

Returns the strongly connected components of this DirHyperGraph. A set of nodes is strongly connected, if there is a path from each node to each other. A set of nodes is called strongly connected component if it is strongly connected and maximal with respect to set inclusion.

Specified by:

getStronglyConnectedComponents in interface DirHyperGraph<Argument>

Returns:

the strongly connected components of this DirHyperGraph.

getSubgraphs

public Collection<SetAf> getSubgraphs(SetAf g)

Returns the set of sub graphs of the given graph.

Parameters:

g - a graph

Returns:

the set of sub graphs of the given graph.

getRestriction

public SetAf getRestriction(Collection<Argument> nodes)

Description copied from interface: DirHyperGraph

Returns copy of this DirHyperGraph consisting only of the given nodes and all corresponding edges.

Specified by:

getRestriction in interface DirHyperGraph<Argument>

Specified by:

getRestriction in interface GeneralGraph<Argument>

Parameters:

nodes - a set of nodes

Returns:

a DirHyperGraph.

hasSelfLoops

public boolean hasSelfLoops()

Description copied from interface: DirHyperGraph

Returns "true" iff the DirHyperGraph has a self loop (an edge from a node to itself).

Specified by:

hasSelfLoops in interface DirHyperGraph<Argument>

Returns:

"true" iff the DirHyperGraph has a self loop (an edge from a node to itself).

isWeightedGraph

public boolean isWeightedGraph()

Description copied from interface: DirHyperGraph

Checks whether this DirHyperGraph only contains weighted edges.

Specified by:

isWeightedGraph in interface DirHyperGraph<Argument>

Returns:

"true" if all edges are weighted in this DirHyperGraph.

add

public boolean add(GeneralEdge edge)

Description copied from interface: DirHyperGraph

Adds the given edge to this DirHyperGraph. If at least one of the nodes the given edge connects is not in the DirHyperGraph, an illegal argument exception is thrown.

Specified by:

add in interface DirHyperGraph<Argument>

Parameters:

edge - some edge.

Returns:

"true" iff the edge has been added successfully.

toString

public String toString()

Specified by:

toString in interface BeliefBase

Specified by:

toString in interface DirHyperGraph<Argument>

Overrides:

toString in class BeliefSet<Argument,SetAfSignature>

getChildren

public Collection<Argument> getChildren(Node node)

Description copied from interface: DirHyperGraph

Returns the set of children (node connected via an undirected edge or a directed edge where the given node is the parent) of the given node.

Specified by:

getChildren in interface DirHyperGraph<Argument>

Parameters:

node - some node (must be in the DirHyperGraph).

Returns:

the set of children of the given node.

getSubGraphs

public Collection<DirHyperGraph<Argument>> getSubGraphs()

Description copied from interface: DirHyperGraph

Returns the set of sub DirHyperGraphs of this DirHyperGraph.

Specified by:

getSubGraphs in interface DirHyperGraph<Argument>

Returns:

the set of sub DirHyperGraphs of this DirHyperGraph.

getSubgraphsHelper

public static Collection<DirHyperGraph<Argument>> getSubgraphsHelper(SetAf g)

Return the subgraphs of the SetAf

Parameters:

g - the SetAf

Returns:

the subgraphs of the SetAf

prettyPrint

public String prettyPrint()

Pretty prints the SetAf

Returns:

string representation of the SetAf