Approximating problems in abstract argumentation with graph convolutional networks

DOI10.1016/J.ARTINT.2024.104209MaRDI QIDQ7028232zbMATH OpenFDO

Authors Lars Malmqvist, Tangming Yuan, Peter W. Nightingale

Publication date 12 February 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104209

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Logic in artificial intelligence (68T27)

Cites work

• Bipolarity in argumentation graphs: towards a better understanding
• Computational properties of argument systems satisfying graph-theoretic constraints
• Computing ideal sceptical argumentation
• Deep learning
• scientific article; zbMATH DE number 6378127 (Why is no real title available?)
• Law and logic: a review from an argumentation perspective
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the impact of data selection when applying machine learning in abstract argumentation
• Probabilities on extensions in abstract argumentation
• Semi-stable semantics
• Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study

Cited in

(2)

• Aripoter: solvers for approximate reasoning based on grounded semantics
• ATWGNNS: graph simplified representation and learning of logical formula for premise selection

This page was built for publication: Approximating problems in abstract argumentation with graph convolutional networks

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