The MatrixX Solver For Argumentation Frameworks

09/29/2021
by   Maximilian Heinrich, et al.
0

MatrixX is a solver for Abstract Argumentation Frameworks. Offensive and defensive properties of an Argumentation Framework are notated in a matrix style. Rows and columns of this matrix are systematically reduced by the solver. This procedure is implemented through the use of hash maps in order to accelerate calculation time. MatrixX works for stable and complete semantics and was designed for the ICCMA 2021 competition.

READ FULL TEXT

page 1

page 2

page 3

research
10/07/2011

The matrices of argumentation frameworks

We introduce matrix and its block to the Dung's theory of argumentation ...
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
12/14/2016

Web-based Argumentation

Assumption-Based Argumentation (ABA) is an argumentation framework that ...
research
09/07/2021

The pyglaf argumentation reasoner (ICCMA2021)

The pyglaf reasoner takes advantage of circumscription to solve computat...
research
10/18/2011

Handling controversial arguments by matrix

We introduce matrix and its block to the Dung's theory of argumentation ...
research
09/10/2012

A matrix approach for computing extensions of argumentation frameworks

The matrices and their sub-blocks are introduced into the study of deter...

Please sign up or login with your details

Forgot password? Click here to reset