Algorithms for computing the set of acceptable arguments

DOI10.1016/J.IJAR.2025.109478MaRDI QIDQ6961565zbMATH OpenFDO

Authors Lars Bengel, Matthias Thimm, Federico Cerutti, Mauro Vallati

Publication date 10 July 2025

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2025.109478

zbMATH Keywords

acceptable argument

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Cites work

• Complexity-sensitive decision procedures for abstract argumentation
• Design and results of the second international competition on computational models of argumentation
• How we designed winning algorithms for abstract argumentation and which insight we attained
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• ICCMA 2023: 5th international competition on computational models of argumentation
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On computing the set of acceptable arguments in abstract argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the complexity of inconsistency measurement
• On the query complexity of selecting minimal sets for monotone predicates
• SCC-recursiveness: a general schema for argumentation semantics
• The first international competition on computational models of argumentation: results and analysis

This page was built for publication: Algorithms for computing the set of acceptable arguments

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