# The MatrixX Solver For Argumentation Frameworks

arXiv: https://arxiv.org/abs/2109.14732 · HTML: https://mlsanity.com/paper/2109.14732/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 1 of its 6 references that are in the map.
- First posted on arXiv 29 Sep 2021.

## Builds on (most cited first, 1 of 1)

- [Design and Results of the Second International Competition on Computational Models of Argumentation](https://mlsanity.com/paper/1909.00621/) (2019)

## Built on by (most cited first, 1 of 1)

- [Computational Argumentation-based Chatbots: a Survey](https://mlsanity.com/paper/2401.03454/) (2024)

## Abstract (arXiv)

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.