A comparative test on the enumeration of extensions in abstract argumentation

DOI10.3233/FI-2015-1254zbMATH Open1348.68237OpenAlexW2126731257MaRDI QIDQ3187009FDOQ3187009

Stefano Bistarelli, Fabio Rossi, Francesco Santini

Publication date: 15 August 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1254

Recommendations

• Enumerating extensions on random abstract-AFs with ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic
• On the computation of Top-\(k\) extensions in abstract argumentation frameworks
• Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
• On the maximal and average numbers of stable extensions
• Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cited In (7)

• Analyzing the Equivalence Zoo in Abstract Argumentation
• Title not available (Why is that?)
• Design and results of the second international competition on computational models of argumentation
• Lattice point of view for argumentation framework
• New stochastic local search approaches for computing preferred extensions of abstract argumentation
• A novel weighted defence and its relaxation in abstract argumentation
• The first international competition on computational models of argumentation: results and analysis

This page was built for publication: A comparative test on the enumeration of extensions in abstract argumentation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3187009)