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

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

    BipartiteGraph.Node<Integer> argument=x;

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

    state ExistsDefender {
        exists{ //Defender
            for (BipartiteGraph.Node<Integer> defender : argument.getParents()){
                ForallAttackers{
                    argument=defender;
                }
            }
        }
    }
}