The pyglaf argumentation reasoner (ICCMA2021)
This work addresses computational challenges in abstract argumentation for AI and logic communities, presenting an incremental improvement by applying existing circumscription methods to this domain.
The pyglaf reasoner tackles computational problems in abstract argumentation frameworks by reducing them to circumscription using linear encodings and sequences of oracle calls, achieving solutions through integration with the glucose SAT solver and algorithms for unsatisfiable core analysis and incremental computation.
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.