The pyglaf argumentation reasoner (ICCMA2021)
Mario Alviano

TL;DR
The pyglaf argumentation reasoner leverages circumscription and advanced SAT solving techniques to efficiently address computational problems in abstract argumentation frameworks, integrating Python control and external solvers.
Contribution
This work introduces pyglaf, a novel argumentation reasoner that combines circumscription, linear encodings, and external SAT-based solvers with Python integration for improved performance.
Findings
Uses circumscription to solve argumentation problems
Employs linear encodings and external circumscription solver
Integrates Python for control and execution management
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation · Logic, Reasoning, and Knowledge · Logic, programming, and type systems
