Abstract Evaluation#

The abstract evaluation feature allows you to compute extensions and labellings of an abstract argumentation framework (AF) using various semantics.

An argumentation framework is defined by:

  • A set of arguments
  • A set of attacks between arguments

The solver provides two main entry points:

abstract::solve/5#

abstract::solve(Arguments, Attacks, I, O, U).
  • First parameter (Arguments): list of arguments
  • Second parameter (Attacks): list of attacks (pairs of arguments)
  • Third parameter (I): the set of arguments labelled In
  • Fourth parameter (O): the set of arguments labelled Out
  • Fifth parameter (U): the set of arguments labelled Undecided

This version returns the computed labelling under the chosen semantics.

Usage Example#

?- abstract::solve([a, b, c], [(a, b), (b, c)], I, O, U).

I = [a,c],
O = [b],
U = [].

In this example, under grounded semantics:

  • Arguments a and c are In
  • Argument b is Out
  • No argument is Undecided

abstract::solve/2#

abstract::solve(Arguments, Attacks).

This version does not return values directly. Instead, the argumentation graph can be inspected programmatically or using:

  • The Graph tab in the Java IDE
  • The Web IDE graph visualization

Semantics Support#

All standard semantics are supported. The evaluation mode can be configured via the argumentLabellingMode\1 flag. See the API page for details.

Backward API & Flags Contributors Forward