# Aspartix-V21

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

## Key facts

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

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

- [Clingo = ASP + Control: Preliminary Report](https://mlsanity.com/paper/1405.3694/) (2014)

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

- [Computational Argumentation-based Chatbots: a Survey](https://mlsanity.com/paper/2401.03454/) (2024)
- [Design and Results of ICCMA 2021](https://mlsanity.com/paper/2109.08884/) (2021)
- [An encoding of argumentation problems using quadratic unconstrained binary optimization](https://mlsanity.com/paper/2409.05524/) (2024)

## Abstract (arXiv)

In this solver description we present ASPARTIX-V, in its 2021 edition, which participates in the International Competition on Computational Models of Argumentation (ICCMA) 2021. ASPARTIX-V is capable of solving all classical (static) reasoning tasks part of ICCMA'21 and extends the ASPARTIX system suite by incorporation of recent ASP language constructs (e.g. conditional literals), domain heuristics within ASP, and multi-shot methods. In this light ASPARTIX-V deviates from the traditional focus of ASPARTIX on monolithic approaches (i.e., one-shot solving via a single ASP encoding) to further enhance performance.