Pith. sign in

REVIEW

The MatrixX Solver For Argumentation Frameworks

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2109.14732 v1 pith:X5MQHNJT submitted 2021-09-29 cs.AI

Maximilian Heinrich This is my paper · ORCID
classification cs.AI
keywords argumentationmatrixxsolverframeworksmatrixabstractacceleratecalculation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

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.

Discussion (0). Continue with ORCID to comment.

Pith tools