Possible controllability of control argumentation frameworks

DOI10.3233/FAIA200512MaRDI QIDQ5145816zbMATH OpenFDO

Authors Jean-Guy Mailly

Publication date 21 January 2021

Full work available at URL https://arxiv.org/abs/2009.04903

zbMATH Keywords

abstract argumentationcomputational complexityuncertainty

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• Toward a computational analysis of probabilistic argumentation frameworks
• Robust semantics for argumentation frameworks
• Epistemic argumentation framework: theory and computation
• Nonmonotonic tools for argumentation
• Probabilistic abstract dialectical frameworks

Cited in

(11)

• Constrained incomplete argumentation frameworks
• Complexity of nonemptiness in control argumentation frameworks
• Extension-based semantics for incomplete argumentation frameworks
• Qualitative uncertainty and dynamics of argumentation through dynamic logic
• Revision, defeasible conditionals and non-monotonic inference for abstract dialectical frameworks
• On incompleteness in abstract argumentation: complexity and expressiveness
• Extension-based semantics for incomplete argumentation frameworks: grounded semantics and principles
• Incomplete higher-order abstract argumentation frameworks
• Grounded semantics and principle-based analysis for incomplete argumentation frameworks
• Revisiting the notions of extension and acceptance over incomplete abstract argumentation frameworks
• Totality, determinism and functionality problems in (incomplete) abstract argumentation frameworks

This page was built for publication: Possible controllability of control argumentation frameworks

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