prefMaxSAT: Exploiting MaxSAT for Enumerating Preferred Extensions. In this paper we introduce prefMaxSAT , a solver that exploits an efficient encoding of preferred extensions search for abstract argumentation, using the MaxSAT approach.

References in zbMATH (referenced in 1 article )

Showing result 1 of 1.
Sorted by year (citations)

  1. Thimm, Matthias; Villata, Serena: The first international competition on computational models of argumentation: results and analysis (2017)