Revisiting approximate reasoning based on grounded semantics
From MaRDI portal
Publication:6587906
DOI10.1007/978-3-031-45608-4_6MaRDI QIDQ6587906FDOQ6587906
Authors: Jérôme Delobelle, Jean-Guy Mailly, Julien Rossit 
Publication date: 15 August 2024
Recommendations
- On computing the set of acceptable arguments in abstract argumentation
- On the computation of Top-\(k\) extensions in abstract argumentation frameworks
- Computing the grounded semantics in all the subgraphs of an argumentation framework: an empirical evaluation
- scientific article; zbMATH DE number 2086469
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning
Cites Work
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A logic-based theory of deductive arguments
- On the Issue of Reinstatement in Argumentation
- From fine-grained properties to broad principles for gradual argumentation: a principled spectrum
- Toward a more efficient generation of structured argumentation graphs
- Design and results of the second international competition on computational models of argumentation
- Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
- A Principle-based Account of Self-attacking Arguments in Gradual Semantics
This page was built for publication: Revisiting approximate reasoning based on grounded semantics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6587906)
