mlsanityData to 14 Oct 2026

The pyglaf argumentation reasoner (ICCMA2021)

arXiv 2109.03162 ↗First posted 7 Sep 2021cs.AIcited by 4

Not on the map. Why?

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.

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

1 of 7 references.

References · 1

  1. 2017Model enumeration in propositional circumscription via unsatisfiable core analysiscited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 0; 2024: 1; 2025: 1; 2026: 1.

4 papers.