Package net.sf.tweety.arg.dung.util

Class PodlaszewskiCaminadaDungTheoryGenerator

  • All Implemented Interfaces:
    java.util.Iterator<DungTheory>, DungTheoryGenerator, BeliefSetIterator<Argument,​DungTheory>
    public class PodlaszewskiCaminadaDungTheoryGenerator
extends java.lang.Object
implements DungTheoryGenerator
    This generator generates abstract argumentation frameworks following the schema described in "Strong Admissibility Revisited" (COMMA2014) by Martin Caminda, following and idea by Mikolay Podlaszewski. These frameworks are supposedly hard for computing grounded semantics.
    Author:
    Matthias Thimm

    • Constructor Summary

      Constructors 
      Constructor Description
      PodlaszewskiCaminadaDungTheoryGenerator​(int numComponents)
      Creates a new generator that generates frameworks of the given numComponents >= 0.

    • Method Summary

      Modifier and Type Method Description
      boolean hasNext()  
      DungTheory next()  
      DungTheory next​(Argument arg)
      Generates a new Dung theory where the given argument is enforced to be in the grounded extension
      void setSeed​(long seed)
      Set the seed for the generation.

      • Methods inherited from class java.lang.Object

        equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

      • Methods inherited from interface java.util.Iterator

        forEachRemaining, remove

    • Constructor Detail

      • PodlaszewskiCaminadaDungTheoryGenerator

        public PodlaszewskiCaminadaDungTheoryGenerator​(int numComponents)
        Creates a new generator that generates frameworks of the given numComponents >= 0. More precisely, the number of arguments in these frameworks have 4 + numComponents*4 arguments.
        Parameters:
        numComponents - the number of components