Indepth combinatorial analysis of admissible sets for abstract argumentation

DOI10.1007/s10472-022-09785-3OpenAlexW4220921382MaRDI QIDQ2107484

Madalina Croitoru, Cosmina Croitoru

Publication date: 1 December 2022

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

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)

Related Items (1)

Lattice point of view for argumentation framework

Cites Work

• Unnamed Item
• Algorithms for decision problems in argument systems under preferred semantics
• Set-rationalizable choice and self-stability
• Graph theoretical structures in logic programs and default theories
• On principle-based evaluation of extension-based argumentation semantics
• Computational properties of argument systems satisfying graph-theoretic constraints
• Combinatorial game theory foundations applied to digraph kernels
• Coherence in finite argument systems.
• 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
• Methods for solving reasoning problems in abstract argumentation -- a survey
• Parametric properties of ideal semantics
• A note on quasi-kernels in digraphs
• On checking skeptical and ideal admissibility in abstract argumentation frameworks
• On the Issue of Reinstatement in Argumentation
• On Decision Problems Related to the Preferred Semantics for Argumentation Frameworks

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