Towards Parallelising Extension Construction for Serialisable Semantics in Abstract Argumentation

We consider the recently proposed notion of serialisability of semantics for abstract argumentation frameworks.

This notion describes a method for the serialised non-deterministic construction of extensions through iterative addition of non-empty minimal admissible sets.

Depending on the semantics, the task of enumerating all extensions for an argumentation framework can be computationally complex.

Serialisability provides a natural way of parallelising the construction of extensions for most admissible-based semantics.

In this work, we investigate the feasibility of using the serialisable construction scheme for a more efficient enumeration of extensions on the example of the recently introduced unchallenged semantics and provide an experimental evaluation.