The first release of pygarg provides algorithms for solving several standard reasoning tasks under most classical extension-based semantics of abstract argumentation frameworks, namely XX-YY where:
- XX in ['DC', 'DS', 'SE', 'EE', 'CE'] for credulous acceptability, skeptical acceptability, computing one extension, enumerating extensions and counting extensions,
- YY in ['CF', 'AD', 'ST', 'CO', 'PR', 'GR', 'ID', 'SST'] for conflict-freeness, admissibility, stable semantics, complete semantics, preferred semantics, grounded semantics, ideal semantics and semi-stable semantics.