Part 1a: Strong and weak admissibility

For the following statements, answer with true or false and justify your answer.

  1. There can be a weak-admissible set which is not admissible.
  2. There can be a strong admissible set which is not admissible.
  3. There is a unique weak grounded extension.
  4. If a set of arguments is preferred, then it is weakly preferred.
  5. If a set of arguments is admissible, then it is weakly admissible.

Part 1b: Computing (weak) extensions

For the graph below, compute the (weak) complete, (weak) grounded, (weak) preferred, and stable extensions.

  1. Graph with a simple self-attacking argument

    Capture d’écran 2024-08-01 à 12.59.46.png

  2. Graph with 7 arguments and odd loop.

    Capture d’écran 2024-08-01 à 12.55.46.png

  3. Graph with two sub-graphs

    Capture d’écran 2024-08-01 à 12.57.29.png

  4. Graph with 10 arguments

    Untitled

Part 2: Computing initial sets and dialogues