The field of computational models of argument aims to provide support for automated reasoning through algorithms that operate on arguments and attack relations between them. In this paper we present a new labelling algorithm that lists all preferred extensions of an abstract argumentation framework. The new algorithm is enhanced by a new pruning strategy. We verified our new labelling algorithm and showed that it enumerates preferred extensions faster than the old labelling algorithm.