# The pyglaf argumentation reasoner (ICCMA2021)

arXiv: https://arxiv.org/abs/2109.03162 · HTML: https://mlsanity.com/paper/2109.03162/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 7 references that are in the map.
- First posted on arXiv 7 Sep 2021.

## Builds on (most cited first, 1 of 1)

- [Model enumeration in propositional circumscription via unsatisfiable core analysis](https://mlsanity.com/paper/1707.01423/) (2017)

## Built on by (most cited first, 4 of 4)

- [Computational Argumentation-based Chatbots: a Survey](https://mlsanity.com/paper/2401.03454/) (2024)
- [Facets in Argumentation: A Formal Approach to Argument Significance](https://mlsanity.com/paper/2505.10982/) (2025)
- [Design and Results of ICCMA 2021](https://mlsanity.com/paper/2109.08884/) (2021)
- [Diversity of Extensions in Abstract Argumentation](https://mlsanity.com/paper/2605.13332/) (2026)

## Abstract (arXiv)

The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks. In fact, many of these problems are reduced to circumscription by means of linear encodings, and a few others are solved by means of a sequence of calls to an oracle for circumscription. Within pyglaf, Python is used to build the encodings and to control the execution of the external circumscription solver, which extends the SAT solver glucose and implements algorithms taking advantage of unsatisfiable core analysis and incremental computation.