Complexity of Possible and Necessary Existence Problems in Abstract Argumentation

DOI10.3233/FAIA200181MaRDI QIDQ4999294zbMATH OpenOpenAlexFDO

Authors Kenneth Skiba, Daniel Neugebauer, Jörg Rothe

Publication date 6 July 2021

Full work available at URL https://dblp.uni-trier.de/db/conf/ecai/ecai2020.html#SkibaNR20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• On incompleteness in abstract argumentation: complexity and expressiveness
• Complexity of abstract argumentation under a claim-centric view
• On the complexity of probabilistic abstract argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Open problems in abstract argumentation
• Complexity results and algorithms for extension enforcement in abstract argumentation
• Possibilistic logic: Complexity and algorithms
• A Complete Classification of the Complexity of Propositional Abduction
• Complexity Classifications for Logic-Based Argumentation

Cited in

(14)

• Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
• Verification in argument-incomplete argumentation frameworks
• Credulous and skeptical acceptance in incomplete argumentation frameworks
• Alternative axiomatics and complexity of deliberative STIT theories
• Acceptance in incomplete argumentation frameworks
• Complexity of nonemptiness in control argumentation frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Complexity of abstract argumentation under a claim-centric view
• scientific article; zbMATH DE number 6902516 (Why is no real title available?)
• On incompleteness in abstract argumentation: complexity and expressiveness
• Verification in incomplete argumentation frameworks
• Infinite argumentation frameworks. On the existence and uniqueness of extensions
• Open problems in abstract argumentation
• I don't care, I don't know \(\dots \) I know too much! on incompleteness and undecidedness in abstract argumentation

This page was built for publication: Complexity of Possible and Necessary Existence Problems in Abstract Argumentation

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