This website contains source codes of some abstract argumentation solvers written under the umbrella of the Tweety project. All solvers implement the probo interface for the argumentation competitions.
All TAAS solvers available on this website are licensed under the GNU Lesser General Public License version 3 except when this is noted otherwise. Use and modification of the solvers is encouraged but please give credit by referring to this website.
- Harper: A very fast solver for polynomial tasks in abstract argumentation pertaining to grounded and complete semantics using Fibonacci heaps. It solves tasks SE-GR, EE-GR, DC-GR, DS-GR, SE-CO, DS-CO (current version 1.0), written in C by Matthias Thimm. src bin (mac)
- Haywood: a solver implementing stochastic local search algorithms to find a single stable extension (SE-ST), also supports tasks SE-GR, EE-GR, DC-GR, DS-GR, SE-CO, DS-CO by using Harper v1.0 as sub solver (current version 1.8), written in C by Matthias Thimm. src bin (mac)