package at.ac.tuwien.dbai.alternation.examples;

atm BipartiteArgumentationSceptical(BipartiteGraph.Node<Integer> x,
                                    BipartiteGraph<Integer> AF) {

    BipartiteGraph.Node<Integer> argument=x;

    state Sceptical{
        forall{//Attackers
            for (BipartiteGraph.Node<Integer> attacker : argument.getParents()){
                ExistsAttacker{
                    argument=attacker;
                }
            }
        }
    }

//CoBipartiteArgumentationCredulous
    state ExistsAttacker {
        exists { // Attacker
            for (BipartiteGraph.Node<Integer> attacker : argument.getParents()){
                ForallDefenders{
                    argument=attacker;
                }
            }
        }
    }

    state ForallDefenders {
        forall{ //Defenders
            for (BipartiteGraph.Node<Integer> defender : argument.getParents()){
                ExistsAttacker{
                    argument=defender;
                }
            }
        }
    }
}