Indepth combinatorial analysis of admissible sets for abstract argumentation

DOI10.1007/S10472-022-09785-3MaRDI QIDQ2107484zbMATH OpenOpenAlexFDO

Authors Cosmina Croitoru, Madalina Croitoru

Publication date 1 December 2022

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10472-022-09785-3

zbMATH Keywords

graph theoryacceptabilityargumentation frameworksdung semantics

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27) Abstract deductive systems (03B22)

Recommendations

• On computing the set of acceptable arguments in abstract argumentation
• Computing strongly admissible sets
• On the Acceptability of Incompatible Arguments
• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• Deliberative acceptability of arguments

Cites work

• scientific article; zbMATH DE number 3465337 (Why is no real title available?)
• A note on quasi-kernels in digraphs
• Algorithms for decision problems in argument systems under preferred semantics
• Coherence in finite argument systems.
• Combinatorial game theory foundations applied to digraph kernels
• Computational properties of argument systems satisfying graph-theoretic constraints
• Graph theoretical structures in logic programs and default theories
• Methods for solving reasoning problems in abstract argumentation -- a survey
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks
• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• On principle-based evaluation of extension-based argumentation semantics
• On the Issue of Reinstatement in Argumentation
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the graded acceptability of arguments in abstract and instantiated argumentation
• Parametric properties of ideal semantics
• Set-rationalizable choice and self-stability

Cited in

(12)

• Towards fixed-parameter tractable algorithms for abstract argumentation
• On computing the set of acceptable arguments in abstract argumentation
• Deliberative acceptability of arguments
• A study of argument acceptability dynamics through core and remainder sets
• Beyond admissibility: accepting cycles in argumentation with game protocols for cogency criteria
• From structured to abstract argumentation: assumption-based acceptance via AF reasoning
• Lattice point of view for argumentation framework
• Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Complexity of abstract argumentation under a claim-centric view
• A practical account into counting Dung's extensions by dynamic programming
• Computing strongly admissible sets

This page was built for publication: Indepth combinatorial analysis of admissible sets for abstract argumentation

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