scientific article; zbMATH DE number 7299863

DOI10.3233/FAIA200512zbMath1464.68366arXiv2009.04903MaRDI QIDQ5145816

Jean-Guy Mailly

Publication date: 21 January 2021

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

uncertaintycomputational complexityabstract argumentation

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)

Related Items (5)

Constrained incomplete argumentation frameworks ⋮ Complexity of nonemptiness in control argumentation frameworks ⋮ 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

This page was built for publication: