paper-with-me

홈 › Papers

Design and Results of ICCMA 2021

2021-09-18 · Jean-Marie Lagniez, Emmanuel Lonca, Jean-Guy Mailly, Julien Rossit

Since 2015, the International Competition on Computational Models of Argumentation (ICCMA) provides a systematic comparison of the different algorithms for solving some classical reasoning problems in the domain of abstract argumentation. This paper discusses the design of the Fourth International Competition on Computational Models of Argumentation. We describe the rules of the competition and the benchmark selection method that we used. After a brief presentation of the competitors, we give an overview of the results.

📄 PDF Abstract BibTeX arXiv:2109.08884

Code (0)

등록된 구현이 없습니다.

Tasks

Abstract Argumentation

Similar Papers 제목 키워드 기반

System Descriptions of the First International Competition on Computational Models of Argumentation (ICCMA'15)

2015-10-19 · Matthias Thimm, Serena Villata

This volume contains the system description of the 18 solvers submitted to the First International Competition on Computational Models of Argumentation (ICCMA'15) and therefore gives an overview on state-of-the-art of co…

Abstract Argumentation

Aspartix-V21

2021-09-07 · Wolfgang Dvořák, Matthias König, Johannes P. Wallner, Stefan Woltran

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 class…

The MatrixX Solver For Argumentation Frameworks

2021-09-29 · Maximilian Heinrich

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…

Abstract Argumentation

Heterogeneous Graph Neural Networks for Assumption-Based Argumentation

2025-11-12 · Preesha Gehlot, Anna Rapberger, Fabrizio Russo, Francesca Toni arxiv

Assumption-Based Argumentation (ABA) is a powerful structured argumentation formalism, but exact computation of extensions under stable semantics is intractable for large frameworks. We present the first Graph Neural Net…

Graph Neural Network

The pyglaf argumentation reasoner (ICCMA2021)

2021-09-07 · Mario Alviano

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, an…

Abstract Argumentation