The pyglaf argumentation reasoner (ICCMA2021)

09/07/2021
by   Mario Alviano, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

research
09/07/2021

Fudge: A light-weight solver for abstract argumentation based on SAT reductions

We present Fudge, an abstract argumentation solver that tightly integrat...
research
09/29/2021

The MatrixX Solver For Argumentation Frameworks

MatrixX is a solver for Abstract Argumentation Frameworks. Offensive and...
research
03/19/2019

Turing-Completeness of Dynamics in Abstract Persuasion Argumentation

Abstract Persuasion Argumentation (APA) is a dynamic argumentation forma...
research
10/10/2018

Incremental SAT Library Integration Using Abstract Stobjs

We describe an effort to soundly use off-the-shelf incremental SAT solve...
research
09/18/2021

Design and Results of ICCMA 2021

Since 2015, the International Competition on Computational Models of Arg...
research
06/08/2020

RBF Solver for Quaternions Interpolation

In this paper we adapt the RBF Solver to work with quaternions by taking...
research
12/14/2016

Web-based Argumentation

Assumption-Based Argumentation (ABA) is an argumentation framework that ...

Please sign up or login with your details

Forgot password? Click here to reset